1. A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

   • Frank E. Curtis
   • Daniel P. Robinson
   • Mohammadreza Samadi

   Full Length Paper 17 May 2016 Pages: 1 - 32

   

2. Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set

   • Jane J. Ye
   • Jinchuan Zhou

   Full Length Paper 23 May 2016 Pages: 33 - 50

3. Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs

   • Shabbir Ahmed
   • James Luedtke
   • Weijun Xie

   Full Length Paper 26 May 2016 Pages: 51 - 81

   

4. Minimizing finite sums with the stochastic average gradient

   • Mark Schmidt
   • Nicolas Le Roux
   • Francis Bach

   Full Length Paper 14 June 2016 Pages: 83 - 112

   

5. Erratum to: Minimizing finite sums with the stochastic average gradient

   • Mark Schmidt
   • Nicolas Le Roux
   • Francis Bach

   Erratum 14 July 2016 Pages: 113 - 113

6. Quadratic reformulations of nonlinear binary optimization problems

   • Martin Anthony
   • Endre Boros
   • Aritanan Gruber

   Full Length Paper 01 June 2016 Pages: 115 - 144

7. Maximizing a class of submodular utility functions with constraints

   • Jiajin Yu
   • Shabbir Ahmed

   Full Length Paper 07 June 2016 Pages: 145 - 164

   

8. On the linear convergence of the alternating direction method of multipliers

   • Mingyi Hong
   • Zhi-Quan Luo

   Full Length Paper 06 July 2016 Pages: 165 - 199

   

9. Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs

   • S. Bianchi
   • M. Escalante
   • L. Tunçel

   Full Length Paper 10 June 2016 Pages: 201 - 223

   

10. Mixed-integer quadratic programming is in NP

    • Alberto Del Pia
    • Santanu S. Dey
    • Marco Molinaro

    Full Length Paper 18 June 2016 Pages: 225 - 240

11. Graph cuts with interacting edge weights: examples, approximations, and algorithms

    • Stefanie Jegelka
    • Jeff A. Bilmes

    Full Length Paper 01 July 2016 Pages: 241 - 282

    

12. An axiomatic duality framework for the theta body and related convex corners

    • Marcel K. de Carli Silva
    • Levent Tunçel

    Full Length Paper 23 July 2016 Pages: 283 - 323

    

13. Finding a low-rank basis in a matrix subspace

    • Yuji Nakatsukasa
    • Tasuku Soma
    • André Uschmajew

    Full Length Paper 29 June 2016 Pages: 325 - 361

    

14. Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization

    • Etienne de Klerk
    • Monique Laurent
    • Zhao Sun

    Full Length Paper 12 July 2016 Pages: 363 - 392

    

15. How to convexify the intersection of a second order cone and a nonconvex quadratic

    • Samuel Burer
    • Fatma Kılınç-Karzan

    Full Length Paper 12 July 2016 Pages: 393 - 429

    

16. Linear conic formulations for two-party correlations and values of nonlocal games

    • Jamie Sikora
    • Antonios Varvitsiotis

    Full Length Paper 29 July 2016 Pages: 431 - 463

    

17. The worst case analysis of strong knapsack facets

    • Sangho Shim
    • Sunil Chopra
    • Wenwei Cao

    Full Length Paper 13 July 2016 Pages: 465 - 493

    

18. Some upper and lower bounds on PSD-rank

    • Troy Lee
    • Zhaohui Wei
    • Ronald de Wolf

    Full Length Paper 16 July 2016 Pages: 495 - 521

19. Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

    • Natashia Boland
    • Santanu S. Dey
    • Fabian Rigterink

    Short Communication 30 May 2016 Pages: 523 - 535

20. A note on alternating projections for ill-posed semidefinite feasibility problems

    • Dmitriy Drusvyatskiy
    • Guoyin Li
    • Henry Wolkowicz

    Short Communication 07 July 2016 Pages: 537 - 548