1. Proximal alternating penalty algorithms for nonsmooth constrained convex optimization

   • Quoc Tran-Dinh

   OriginalPaper 27 September 2018 Pages: 1 - 43

   

2. On monotone and primal-dual active set schemes for \(\ell ^p\)-type problems, \(p \in (0,1]\)

   • Daria Ghilli
   • Karl Kunisch

   OriginalPaper Open access 04 October 2018 Pages: 45 - 85

   

3. Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs

   • Yangyang Xu

   OriginalPaper 27 September 2018 Pages: 87 - 113

   

4. Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

   • Bo Jiang
   • Tianyi Lin
   • Shuzhong Zhang

   OriginalPaper 25 September 2018 Pages: 115 - 157

   

5. Newton’s method with feasible inexact projections for solving constrained generalized equations

   • Fabiana R. de Oliveira
   • Orizon P. Ferreira
   • Gilson N. Silva

   OriginalPaper 26 October 2018 Pages: 159 - 177

   

6. Convergence of the augmented decomposition algorithm

   • Hongsheng Liu
   • Shu Lu

   OriginalPaper 22 October 2018 Pages: 179 - 213

   

7. A globally convergent Levenberg–Marquardt method for equality-constrained optimization

   • A. F. Izmailov
   • M. V. Solodov
   • E. I. Uskov

   OriginalPaper 03 October 2018 Pages: 215 - 239

   

8. A homogeneous model for monotone mixed horizontal linear complementarity problems

   • Cosmin G. Petra
   • Florian A. Potra

   OriginalPaper 22 September 2018 Pages: 241 - 267

   

9. On the optimal solution set in interval linear programming

   • Elif Garajová
   • Milan Hladík

   OriginalPaper 17 August 2018 Pages: 269 - 292