1. Matrix optimization based Euclidean embedding with outliers

   • Qian Zhang
   • Xinyuan Zhao
   • Chao Ding

   OriginalPaper 28 April 2021 Pages: 235 - 271

   

2. Low-rank factorization for rank minimization with nonconvex regularizers

   • April Sagan
   • John E. Mitchell

   OriginalPaper 24 April 2021 Pages: 273 - 300

   

3. DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization

   • Jean Bigeon
   • Sébastien Le Digabel
   • Ludovic Salomon

   OriginalPaper 27 March 2021 Pages: 301 - 338

   

4. A stochastic subspace approach to gradient-free optimization in high dimensions

   • David Kozak
   • Stephen Becker
   • Luis Tenorio

   OriginalPaper 13 April 2021 Pages: 339 - 368

   

5. Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences

   • Majid Jahani
   • Naga Venkata C. Gudapati
   • Martin Takáč

   OriginalPaper 08 April 2021 Pages: 369 - 404

   

6. Accelerated Bregman proximal gradient methods for relatively smooth convex optimization

   • Filip Hanzely
   • Peter Richtárik
   • Lin Xiao

   OriginalPaper 07 April 2021 Pages: 405 - 440

   

7. A Laplacian approach to \(\ell _1\)-norm minimization

   • Vincenzo Bonifaci

   OriginalPaper Open access 19 March 2021 Pages: 441 - 469

   

8. An accelerated first-order method with complexity analysis for solving cubic regularization subproblems

   • Rujun Jiang
   • Man-Chung Yue
   • Zhishuo Zhou

   OriginalPaper 27 March 2021 Pages: 471 - 506

   

9. The circumcentered-reflection method achieves better rates than alternating projections

   • Reza Arefidamghani
   • Roger Behling
   • Luiz-Rafael Santos

   OriginalPaper 19 April 2021 Pages: 507 - 530