Matrix optimization based Euclidean embedding with outliers Qian ZhangXinyuan ZhaoChao Ding OriginalPaper 28 April 2021 Pages: 235 - 271
Low-rank factorization for rank minimization with nonconvex regularizers April SaganJohn E. Mitchell OriginalPaper 24 April 2021 Pages: 273 - 300
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization Jean BigeonSébastien Le DigabelLudovic Salomon OriginalPaper 27 March 2021 Pages: 301 - 338
A stochastic subspace approach to gradient-free optimization in high dimensions David KozakStephen BeckerLuis Tenorio OriginalPaper 13 April 2021 Pages: 339 - 368
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences Majid JahaniNaga Venkata C. GudapatiMartin Takáč OriginalPaper 08 April 2021 Pages: 369 - 404
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization Filip HanzelyPeter RichtárikLin Xiao OriginalPaper 07 April 2021 Pages: 405 - 440
A Laplacian approach to \(\ell _1\)-norm minimization Vincenzo Bonifaci OriginalPaper Open access 19 March 2021 Pages: 441 - 469
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems Rujun JiangMan-Chung YueZhishuo Zhou OriginalPaper 27 March 2021 Pages: 471 - 506
The circumcentered-reflection method achieves better rates than alternating projections Reza ArefidamghaniRoger BehlingLuiz-Rafael Santos OriginalPaper 19 April 2021 Pages: 507 - 530