| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
|
Siddig, Murwan
|
|
|
81 |
1 |
p. 201-250
|
article
|
| 2 |
A piecewise conservative method for unconstrained convex optimization
|
Scagliotti, A.
|
|
|
81 |
1 |
p. 251-288
|
article
|
| 3 |
A Riemannian rank-adaptive method for low-rank matrix completion
|
Gao, Bin
|
|
|
81 |
1 |
p. 67-90
|
article
|
| 4 |
A sublevel moment-SOS hierarchy for polynomial optimization
|
Chen, Tong
|
|
|
81 |
1 |
p. 31-66
|
article
|
| 5 |
Bregman primal–dual first-order method and application to sparse semidefinite programming
|
Jiang, Xin
|
|
|
81 |
1 |
p. 127-159
|
article
|
| 6 |
Expected complexity analysis of stochastic direct-search
|
Dzahini, Kwassi Joseph
|
|
|
81 |
1 |
p. 179-200
|
article
|
| 7 |
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
|
Haythorpe, Michael
|
|
|
81 |
1 |
p. 309-336
|
article
|
| 8 |
Finding best approximation pairs for two intersections of closed convex sets
|
Bauschke, Heinz H.
|
|
|
81 |
1 |
p. 289-308
|
article
|
| 9 |
On large-scale unconstrained optimization and arbitrary regularization
|
MartÃnez, J. M.
|
|
|
81 |
1 |
p. 1-30
|
article
|
| 10 |
On R-linear convergence analysis for a class of gradient methods
|
Huang, Na
|
|
|
81 |
1 |
p. 161-177
|
article
|
| 11 |
On the inexact scaled gradient projection method
|
Ferreira, O. P.
|
|
|
81 |
1 |
p. 91-125
|
article
|
Journal description