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