1. Necessary conditions for linear convergence of iterated expansive, set-valued mappings

   • D. Russell Luke
   • Marc Teboulle
   • Nguyen H. Thao

   Full Length Paper 26 October 2018 Pages: 1 - 31

2. Piecewise affine parameterized value-function based bilevel non-cooperative games

   • Tianyu Hao
   • Jong-Shi Pang

   Full Length Paper 10 November 2018 Pages: 33 - 73

   

3. Second-order variational analysis in second-order cone programming

   • Nguyen T. V. Hang
   • Boris S. Mordukhovich
   • M. Ebrahim Sarabi

   Full Length Paper 03 November 2018 Pages: 75 - 116

4. Network strength games: the core and the nucleolus

   • Mourad Baïou
   • Francisco Barahona

   Full Length Paper 09 November 2018 Pages: 117 - 136

   

5. Convergence rate of inertial Forward–Backward algorithm beyond Nesterov’s rule

   • Vassilis Apidopoulos
   • Jean-François Aujol
   • Charles Dossal

   Full Length Paper 12 November 2018 Pages: 137 - 156

   

6. A simplex-type algorithm for continuous linear programs with constant coefficients

   • Evgeny Shindin
   • Gideon Weiss

   Full Length Paper 03 December 2018 Pages: 157 - 201

   

7. Optimality conditions and global convergence for nonlinear semidefinite programming

   • Roberto Andreani
   • Gabriel Haeser
   • Daiana S. Viana

   Full Length Paper 07 December 2018 Pages: 203 - 235

   

8. Communication-efficient algorithms for decentralized and stochastic optimization

   • Guanghui Lan
   • Soomin Lee
   • Yi Zhou

   Full Length Paper 07 December 2018 Pages: 237 - 284

   

9. Using regularization and second order information in outer approximation for convex MINLP

   • Jan Kronqvist
   • David E. Bernal
   • Ignacio E. Grossmann

   Full Length Paper 18 December 2018 Pages: 285 - 310

   

10. Balas formulation for the union of polytopes is optimal

    • Michele Conforti
    • Marco Di Summa
    • Yuri Faenza

    Full Length Paper 19 January 2019 Pages: 311 - 326

11. Varying confidence levels for CVaR risk measures and minimax limits

    • Edward Anderson
    • Huifu Xu
    • Dali Zhang

    Full Length Paper 22 January 2019 Pages: 327 - 370

    

12. New analysis of linear convergence of gradient-type methods via unifying error bound conditions

    • Hui Zhang

    Full Length Paper 04 January 2019 Pages: 371 - 416

13. Faster subgradient methods for functions with Hölderian growth

    • Patrick R. Johnstone
    • Pierre Moulin

    Full Length Paper 07 January 2019 Pages: 417 - 450

    

14. A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization

    • Clément W. Royer
    • Michael O’Neill
    • Stephen J. Wright

    Full Length Paper 19 January 2019 Pages: 451 - 488

    

15. Chordal decomposition in operator-splitting methods for sparse semidefinite programs

    • Yang Zheng
    • Giovanni Fantuzzi
    • Andrew Wynn

    Full Length Paper Open access 20 February 2019 Pages: 489 - 532