| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A dual adaptive algorithm for matrix optimization with sparse group lasso regularization
|
Yang, Jinji
|
|
|
92 |
3 |
p. 737-774
|
artikel
|
| 2 |
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem
|
Zhang, Lifeng
|
|
|
92 |
3 |
p. 809-835
|
artikel
|
| 3 |
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
|
Chen, Kai
|
|
|
92 |
3 |
p. 775-807
|
artikel
|
| 4 |
Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems
|
Huang, Q. Y.
|
|
|
92 |
3 |
p. 535-568
|
artikel
|
| 5 |
Distributionally Robust Optimization with Polynomial Robust Constraints
|
Nie, Jiawang
|
|
|
92 |
3 |
p. 509-534
|
artikel
|
| 6 |
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems
|
Giovannelli, T.
|
|
|
92 |
3 |
p. 569-614
|
artikel
|
| 7 |
Infinite-dimensional convex cones: internal geometric structure and analytical representation
|
Gorokhovik, Valentin V.
|
|
|
92 |
3 |
p. 643-662
|
artikel
|
| 8 |
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
|
Choi, Woocheol
|
|
|
92 |
3 |
p. 713-736
|
artikel
|
| 9 |
Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
|
Sass, Susanne
|
|
|
92 |
3 |
p. 615-642
|
artikel
|
| 10 |
Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares
|
Fodor, Lidija
|
|
|
92 |
3 |
p. 663-691
|
artikel
|
| 11 |
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems
|
Wang, Tanxing
|
|
|
92 |
3 |
p. 693-711
|
artikel
|
Tijdschrift beschrijving