| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction
|
Berahas, Albert S.
|
|
|
86 |
1 |
p. 79-116
|
article
|
| 2 |
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
|
Li, Shaoze
|
|
|
86 |
1 |
p. 241-273
|
article
|
| 3 |
A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
|
Huang, Baohua
|
|
|
86 |
1 |
p. 345-381
|
article
|
| 4 |
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
|
Ek, David
|
|
|
86 |
1 |
p. 1-48
|
article
|
| 5 |
Average curvature FISTA for nonconvex smooth composite optimization problems
|
Liang, Jiaming
|
|
|
86 |
1 |
p. 275-302
|
article
|
| 6 |
Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
|
Traoré, Cheik
|
|
|
86 |
1 |
p. 303-344
|
article
|
| 7 |
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
|
Luo, Hezhi
|
|
|
86 |
1 |
p. 199-240
|
article
|
| 8 |
GLISp-r: a preference-based optimization algorithm with convergence guarantees
|
Previtali, Davide
|
|
|
86 |
1 |
p. 383-420
|
article
|
| 9 |
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
|
Ding, Kuang-Yu
|
|
|
86 |
1 |
p. 117-161
|
article
|
| 10 |
On solving difference of convex functions programs with linear complementarity constraints
|
Le Thi, Hoai An
|
|
|
86 |
1 |
p. 163-197
|
article
|
| 11 |
Recycling basic columns of the splitting preconditioner in interior point methods
|
Castro, Cecilia Orellana
|
|
|
86 |
1 |
p. 49-78
|
article
|
Journal description