On large-scale unconstrained optimization and arbitrary regularization J. M. MartÃnezL. T. Santos OriginalPaper 25 October 2021 Pages: 1 - 30
A sublevel moment-SOS hierarchy for polynomial optimization Tong ChenJean-Bernard LasserreEdouard Pauwels OriginalPaper 19 November 2021 Pages: 31 - 66
A Riemannian rank-adaptive method for low-rank matrix completion Bin GaoP.-A. Absil OriginalPaper Open access 13 November 2021 Pages: 67 - 90
On the inexact scaled gradient projection method O. P. FerreiraM. LemesL. F. Prudente OriginalPaper 24 November 2021 Pages: 91 - 125
Bregman primal–dual first-order method and application to sparse semidefinite programming Xin JiangLieven Vandenberghe OriginalPaper Open access 04 December 2021 Pages: 127 - 159
On R-linear convergence analysis for a class of gradient methods Na Huang OriginalPaper 17 November 2021 Pages: 161 - 177
Expected complexity analysis of stochastic direct-search Kwassi Joseph Dzahini OriginalPaper 27 November 2021 Pages: 179 - 200
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse Murwan SiddigYongjia Song OriginalPaper 03 November 2021 Pages: 201 - 250
A piecewise conservative method for unconstrained convex optimization A. ScagliottiP. Colli Franzone OriginalPaper 22 November 2021 Pages: 251 - 288
Finding best approximation pairs for two intersections of closed convex sets Heinz H. BauschkeShambhavi SinghXianfu Wang OriginalPaper 02 November 2021 Pages: 289 - 308
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem Michael HaythorpeWalter Murray OriginalPaper 06 November 2021 Pages: 309 - 336