1. Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

   • Nicholas I. M. Gould
   • Tyrone Rees
   • Jennifer A. Scott

   OriginalPaper 15 February 2019 Pages: 1 - 35

   

2. A new approximation hierarchy for polynomial conic optimization

   • Peter J. C. Dickinson
   • Janez Povh

   OriginalPaper 29 January 2019 Pages: 37 - 67

   

3. A refined convergence analysis of \(\hbox {pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection

   • Tianxiang Liu
   • Ting Kei Pong
   • Akiko Takeda

   OriginalPaper 25 January 2019 Pages: 69 - 100

   

4. Graph-based algorithms for the efficient solution of optimization problems involving monotone functions

   • Luca Consolini
   • Mattia Laurini
   • Marco Locatelli

   OriginalPaper 29 January 2019 Pages: 101 - 128

   

5. General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems

   • Zhongming Wu
   • Min Li

   OriginalPaper 18 February 2019 Pages: 129 - 158

   

6. Fast bundle-level methods for unconstrained and ball-constrained convex optimization

   • Yunmei Chen
   • Guanghui Lan
   • Wei Zhang

   OriginalPaper 07 February 2019 Pages: 159 - 199

   

7. Inexact alternating direction methods of multipliers for separable convex optimization

   • William W. Hager
   • Hongchao Zhang

   OriginalPaper 07 February 2019 Pages: 201 - 235

   

8. Projective method of multipliers for linearly constrained convex minimization

   • Majela Pentón Machado

   OriginalPaper 22 January 2019 Pages: 237 - 273

   

9. A strong Lagrangian relaxation for general discrete-choice network revenue management

   • Sumit Kunnumkal
   • Kalyan Talluri

   OriginalPaper Open access 22 March 2019 Pages: 275 - 310

   

10. PAL-Hom method for QP and an application to LP

    • Guoqiang Wang
    • Bo Yu

    OriginalPaper 09 February 2019 Pages: 311 - 352