1. Subspace quadratic regularization method for group sparse multinomial logistic regression

   • Rui Wang
   • Naihua Xiu
   • Kim-Chuan Toh

   OriginalPaper 12 June 2021 Pages: 531 - 559

   

2. Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems

   • G. Liuzzi
   • M. Locatelli
   • S. Rass

   OriginalPaper Open access 22 May 2021 Pages: 561 - 599

   

3. An effective logarithmic formulation for piecewise linearization requiring no inequality constraint

   • F. J. Hwang
   • Yao-Huei Huang

   OriginalPaper 01 June 2021 Pages: 601 - 631

   

4. On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming

   • R. Andreani
   • E. H. Fukuda
   • L. D. Secchin

   OriginalPaper 10 May 2021 Pages: 633 - 648

   

5. A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems

   • Jiaming Liang
   • Renato D. C. Monteiro
   • Chee-Khian Sim

   OriginalPaper 13 May 2021 Pages: 649 - 679

6. Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization

   • Masoud Ahookhosh
   • Le Thi Khanh Hien
   • Panagiotis Patrinos

   OriginalPaper 09 June 2021 Pages: 681 - 715

   

7. Fastest rates for stochastic mirror descent methods

   • Filip Hanzely
   • Peter Richtárik

   OriginalPaper 09 June 2021 Pages: 717 - 766

   

8. A dual simplex-type algorithm for the smallest enclosing ball of balls

   • Marta Cavaleiro
   • Farid Alizadeh

   OriginalPaper 26 May 2021 Pages: 767 - 787

   

9. Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function

   • David Ek
   • Anders Forsgren

   OriginalPaper Open access 28 April 2021 Pages: 789 - 816