1. Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization

   • Xiaoqin Hua
   • Nobuo Yamashita

   Full Length Paper 27 January 2016 Pages: 1 - 32

   

2. On the multiplier-penalty-approach for quasi-variational inequalities

   • Christian Kanzow

   Full Length Paper 07 January 2016 Pages: 33 - 63

3. A copositive formulation for the stability number of infinite graphs

   • Cristian Dobre
   • Mirjam Dür
   • Frank Vallentin

   Full Length Paper 09 January 2016 Pages: 65 - 83

4. On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

   • Egon Balas
   • Tamás Kis

   Full Length Paper 14 January 2016 Pages: 85 - 114

   

5. Second order analysis of control-affine problems with scalar state constraint

   • M. S. Aronna
   • J. F. Bonnans
   • B. S. Goh

   Full Length Paper 09 January 2016 Pages: 115 - 147

6. Sparse sums of squares on finite abelian groups and improved semidefinite lifts

   • Hamza Fawzi
   • James Saunderson
   • Pablo A. Parrilo

   Full Length Paper 27 January 2016 Pages: 149 - 191

   

7. Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions

   • Sarah M. Moffat
   • Walaa M. Moursi
   • Xianfu Wang

   Full Length Paper 28 January 2016 Pages: 193 - 223

   

8. Approximation algorithms for inventory problems with submodular or routing costs

   • Viswanath Nagarajan
   • Cong Shi

   Full Length Paper 18 February 2016 Pages: 225 - 244

   

9. On the polyhedrality of cross and quadrilateral closures

   • Sanjeeb Dash
   • Oktay Günlük
   • Diego A. Morán R.

   Full Length Paper 13 February 2016 Pages: 245 - 270

   

10. A bundle-free implicit programming approach for a class of elliptic MPECs in function space

    • M. Hintermüller
    • T. Surowiec

    Full Length Paper 28 March 2016 Pages: 271 - 305

    

11. On the worst case performance of the steepest descent algorithm for quadratic functions

    • Clóvis C. Gonzaga

    Full Length Paper 18 February 2016 Pages: 307 - 320

    

12. An optimal variant of Kelley’s cutting-plane method

    • Yoel Drori
    • Marc Teboulle

    Full Length Paper 16 February 2016 Pages: 321 - 351

    

13. Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

    • Michal Červinka
    • Christian Kanzow
    • Alexandra Schwartz

    Full Length Paper 16 February 2016 Pages: 353 - 377

    

14. On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

    • Andreas Emil Feldmann
    • Jochen Könemann
    • Laura Sanità

    Full Length Paper 18 February 2016 Pages: 379 - 406

    

15. Average case polyhedral complexity of the maximum stable set problem

    • Gábor Braun
    • Samuel Fiorini
    • Sebastian Pokutta

    Full Length Paper 25 March 2016 Pages: 407 - 431

    

16. Approximating the little Grothendieck problem over the orthogonal and unitary groups

    • Afonso S. Bandeira
    • Christopher Kennedy
    • Amit Singer

    Full Length Paper 25 March 2016 Pages: 433 - 475

    

17. Some LCPs solvable in strongly polynomial time with Lemke’s algorithm

    • Ilan Adler
    • Richard W. Cottle
    • Jong-Shi Pang

    Full Length Paper 28 March 2016 Pages: 477 - 493

18. Practical inexact proximal quasi-Newton method with global complexity analysis

    • Katya Scheinberg
    • Xiaocheng Tang

    Full Length Paper 31 March 2016 Pages: 495 - 529

    

19. The impact of the existence of multiple adjustable robust solutions

    • Frans J. C. T. de Ruiter
    • Ruud C. M. Brekelmans
    • Dick den Hertog

    Short Communication Open access 30 January 2016 Pages: 531 - 545

    

20. Newton’s method may fail to recognize proximity to optimal points in constrained optimization

    • R. Andreani
    • J. M. Martínez
    • L. T. Santos

    Short Communication 23 February 2016 Pages: 547 - 555