1. Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition

   • Brian Irwin
   • Eldad Haber

   OriginalPaper 09 January 2023 Pages: 651 - 702

   

2. Conic formulation of QPCCs applied to truly sparse QPs

   • Immanuel M. Bomze
   • Bo Peng

   OriginalPaper Open access 13 December 2022 Pages: 703 - 735

   

3. A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_{0}}\) regularization problem

   • Jie Zhang
   • Xinmin Yang
   • Ke Zhang

   OriginalPaper 11 January 2023 Pages: 737 - 760

   

4. T-product factorization based method for matrix and tensor completion problems

   • Quan Yu
   • Xinzhen Zhang

   OriginalPaper 30 November 2022 Pages: 761 - 788

   

5. Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes

   • Renaud Chicoisne

   OriginalPaper 20 January 2023 Pages: 789 - 831

   

6. Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares

   • Naoki Marumo
   • Takayuki Okuno
   • Akiko Takeda

   OriginalPaper Open access 17 January 2023 Pages: 833 - 874

   

7. A matrix nonconvex relaxation approach to unconstrained binary polynomial programs

   • Yitian Qian
   • Shaohua Pan
   • Shujun Bi

   OriginalPaper 27 December 2022 Pages: 875 - 919

8. On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions

   • Claire Boyer
   • Antoine Godichon-Baggioni

   OriginalPaper 29 December 2022 Pages: 921 - 972

   

9. Lifted stationary points of sparse optimization with complementarity constraints

   • Shisen Liu
   • Xiaojun Chen

   OriginalPaper 25 December 2022 Pages: 973 - 1003

   

10. A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization

    • Yonggang Pei
    • Shaofang Song
    • Detong Zhu

    OriginalPaper 10 January 2023 Pages: 1005 - 1033