| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
|
Lee, Ching-pei
|
|
|
201 |
1-2 |
p. 599-633
|
artikel
|
| 2 |
An approximation algorithm for indefinite mixed integer quadratic programming
|
Pia, Alberto Del
|
|
|
201 |
1-2 |
p. 263-293
|
artikel
|
| 3 |
An elementary approach to tight worst case complexity analysis of gradient based methods
|
Teboulle, Marc
|
|
|
201 |
1-2 |
p. 63-96
|
artikel
|
| 4 |
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
|
Yang, Heng
|
|
|
201 |
1-2 |
p. 409-472
|
artikel
|
| 5 |
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
|
Baraldi, Robert J.
|
|
|
201 |
1-2 |
p. 559-598
|
artikel
|
| 6 |
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
|
Zhou, Yuhao
|
|
|
201 |
1-2 |
p. 1-61
|
artikel
|
| 7 |
A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems
|
Xu, Zi
|
|
|
201 |
1-2 |
p. 635-706
|
artikel
|
| 8 |
Consistent approximations in composite optimization
|
Royset, Johannes O.
|
|
|
201 |
1-2 |
p. 339-372
|
artikel
|
| 9 |
Constrained composite optimization and augmented Lagrangian methods
|
De Marchi, Alberto
|
|
|
201 |
1-2 |
p. 863-896
|
artikel
|
| 10 |
Faster first-order primal-dual methods for linear programming using restarts and sharpness
|
Applegate, David
|
|
|
201 |
1-2 |
p. 133-184
|
artikel
|
| 11 |
Hessian averaging in stochastic Newton methods achieves superlinear convergence
|
Na, Sen
|
|
|
201 |
1-2 |
p. 473-520
|
artikel
|
| 12 |
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
|
Doron, Lior
|
|
|
201 |
1-2 |
p. 521-558
|
artikel
|
| 13 |
Principled analyses and design of first-order methods with inexact proximal operators
|
Barré, Mathieu
|
|
|
201 |
1-2 |
p. 185-230
|
artikel
|
| 14 |
Resolvent splitting for sums of monotone operators with minimal lifting
|
Malitsky, Yura
|
|
|
201 |
1-2 |
p. 231-262
|
artikel
|
| 15 |
Smooth over-parameterized solvers for non-smooth structured optimization
|
Poon, Clarice
|
|
|
201 |
1-2 |
p. 897-952
|
artikel
|
| 16 |
Softmax policy gradient methods can take exponential time to converge
|
Li, Gen
|
|
|
201 |
1-2 |
p. 707-802
|
artikel
|
| 17 |
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
|
Yu, Qimeng
|
|
|
201 |
1-2 |
p. 803-861
|
artikel
|
| 18 |
Supermodularity and valid inequalities for quadratic optimization with indicators
|
Atamtürk, Alper
|
|
|
201 |
1-2 |
p. 295-338
|
artikel
|
| 19 |
The landscape of the proximal point method for nonconvex–nonconcave minimax optimization
|
Grimmer, Benjamin
|
|
|
201 |
1-2 |
p. 373-407
|
artikel
|
| 20 |
Trace ratio optimization with an application to multi-view learning
|
Wang, Li
|
|
|
201 |
1-2 |
p. 97-131
|
artikel
|
Tijdschrift beschrijving