1. Hidden conic quadratic representation of some nonconvex quadratic optimization problems

   • Aharon Ben-Tal
   • Dick den Hertog

   Full Length Paper 20 September 2013 Pages: 1 - 29

2. Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints

   • Hailin Sun
   • Huifu Xu

   Full Length Paper 24 September 2013 Pages: 31 - 59

3. Improved semidefinite bounding procedure for solving Max-Cut problems to optimality

   • Nathan Krislock
   • Jérôme Malick
   • Frédéric Roupin

   Full Length Paper 13 October 2012 Pages: 61 - 86

   

4. Coordinated cutting plane generation via multi-objective separation

   • Edoardo Amaldi
   • Stefano Coniglio
   • Stefano Gualandi

   Full Length Paper 18 October 2012 Pages: 87 - 110

   

5. An algorithm for the separation of two-row cuts

   • Quentin Louveaux
   • Laurent Poirrier

   Full Length Paper 11 October 2012 Pages: 111 - 146

   

6. Chain rules for linear openness in metric spaces and applications

   • Marius Durea
   • Radu Strugariu

   Full Length Paper 12 October 2012 Pages: 147 - 176

7. A class of Dantzig–Wolfe type decomposition methods for variational inequality problems

   • Juan Pablo Luna
   • Claudia Sagastizábal
   • Mikhail Solodov

   Full Length Paper 23 October 2012 Pages: 177 - 209

   

8. Factorization and cutting planes for completely positive matrices by copositive projection

   • Julia Sponsel
   • Mirjam Dür

   Full Length Paper 27 October 2012 Pages: 211 - 229

9. Unbounded convex sets for non-convex mixed-integer quadratic programming

   • Samuel Burer
   • Adam N. Letchford

   Full Length Paper 16 October 2012 Pages: 231 - 256

   

10. Dynamic graph generation for the shortest path problem in time expanded networks

    • Frank Fischer
    • Christoph Helmberg

    Full Length Paper 30 October 2012 Pages: 257 - 297

    

11. Convex optimization for the planted k-disjoint-clique problem

    • Brendan P. W. Ames
    • Stephen A. Vavasis

    Full Length Paper 07 December 2013 Pages: 299 - 337

    

12. MM algorithms for geometric and signomial programming

    • Kenneth Lange
    • Hua Zhou

    Full Length Paper 26 October 2012 Pages: 339 - 356

    

13. Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture

    • Edward D. Kim

    Full Length Paper 30 October 2012 Pages: 357 - 370

    

14. Complexity of unconstrained \(L_2-L_p\) minimization

    • Xiaojun Chen
    • Dongdong Ge
    • Yinyu Ye

    Short Communication 30 November 2012 Pages: 371 - 383