| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Abstract strongly convergent variants of the proximal point algorithm
|
Sipoş, Andrei
|
|
|
83 |
1 |
p. 349-380
|
article
|
| 2 |
A product space reformulation with reduced dimension for splitting algorithms
|
Campoy, Rubén
|
|
|
83 |
1 |
p. 319-348
|
article
|
| 3 |
A stochastic primal-dual method for a class of nonconvex constrained optimization
|
Jin, Lingzi
|
|
|
83 |
1 |
p. 143-180
|
article
|
| 4 |
Block coordinate descent for smooth nonconvex constrained minimization
|
Birgin, E. G.
|
|
|
83 |
1 |
p. 1-27
|
article
|
| 5 |
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
|
Qu, Xin
|
|
|
83 |
1 |
p. 287-317
|
article
|
| 6 |
Inertial alternating direction method of multipliers for non-convex non-smooth optimization
|
Hien, Le Thi Khanh
|
|
|
83 |
1 |
p. 247-285
|
article
|
| 7 |
Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem
|
Campbell, James
|
|
|
83 |
1 |
p. 67-109
|
article
|
| 8 |
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
|
Vitor, Fabio
|
|
|
83 |
1 |
p. 211-246
|
article
|
| 9 |
Quantifying uncertainty with ensembles of surrogates for blackbox optimization
|
Audet, Charles
|
|
|
83 |
1 |
p. 29-66
|
article
|
| 10 |
Robust min-max regret covering problems
|
Coco, Amadeu A.
|
|
|
83 |
1 |
p. 111-141
|
article
|
| 11 |
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
|
Eisenmann, Monika
|
|
|
83 |
1 |
p. 181-210
|
article
|
Journal description