1. Discrete convexity and polynomial solvability in minimum 0-extension problems

   • Hiroshi Hirai

   Full Length Paper 24 October 2014 Pages: 1 - 55

   

2. The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

   • Caihua Chen
   • Bingsheng He
   • Xiaoming Yuan

   Full Length Paper 17 October 2014 Pages: 57 - 79

   

3. Higher-order reverse automatic differentiation with emphasis on the third-order

   • R. M. Gower
   • A. L. Gower

   Full Length Paper 29 October 2014 Pages: 81 - 103

   

4. Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

   • Shai Shalev-Shwartz
   • Tong Zhang

   Full Length Paper 20 November 2014 Pages: 105 - 145

   

5. Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation

   • Daniel Porumbel

   Full Length Paper 17 December 2014 Pages: 147 - 197

   

6. New analysis and results for the Frank–Wolfe method

   • Robert M. Freund
   • Paul Grigas

   Full Length Paper 28 November 2014 Pages: 199 - 230

   

7. Distributionally robust chance constraints for non-linear uncertainties

   • Wenzhuo Yang
   • Huan Xu

   Full Length Paper 19 November 2014 Pages: 231 - 265

   

8. Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

   • Saeed Ghadimi
   • Guanghui Lan
   • Hongchao Zhang

   Full Length Paper 11 December 2014 Pages: 267 - 305

   

9. Worst case complexity of direct search under convexity

   • M. Dodangeh
   • L. N. Vicente

   Full Length Paper 28 November 2014 Pages: 307 - 332

   

10. A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

    • Xudong Li
    • Defeng Sun
    • Kim-Chuan Toh

    Full Length Paper 14 December 2014 Pages: 333 - 373

    

11. Constraint aggregation for rigorous global optimization

    • Ferenc Domes
    • Arnold Neumaier

    Full Length Paper 16 December 2014 Pages: 375 - 401

    

12. Conic version of Loewner–John ellipsoid theorem

    • Alberto Seeger
    • Mounir Torki

    Full Length Paper 14 December 2014 Pages: 403 - 433

13. A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

    • Caihua Chen
    • Yong-Jin Liu
    • Kim-Chuan Toh

    Full Length Paper 21 December 2014 Pages: 435 - 470

    

14. The continuous knapsack set

    • Sanjeeb Dash
    • Oktay Günlük
    • Laurence A. Wolsey

    Full Length Paper 06 February 2015 Pages: 471 - 496

    

15. A deterministic rescaled perceptron algorithm

    • Javier Peña
    • Negar Soheili

    Full Length Paper 17 January 2015 Pages: 497 - 510

    

16. Iteration-complexity of first-order augmented Lagrangian methods for convex programming

    • Guanghui Lan
    • Renato D. C. Monteiro

    Full Length Paper 24 January 2015 Pages: 511 - 547

    

17. Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm

    • Deanna Needell
    • Nathan Srebro
    • Rachel Ward

    Full Length Paper 03 February 2015 Pages: 549 - 573

    

18. Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

    • Sina Modaresi
    • Mustafa R. Kılınç
    • Juan Pablo Vielma

    Full Length Paper 17 February 2015 Pages: 575 - 611

    

19. A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods

    • M. Marques Alves
    • B. F. Svaiter

    Short Communication 04 December 2014 Pages: 613 - 616

20. Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix

    • Alexander Kogan
    • Miguel A. Lejeune
    • James Luedtke

    Erratum 11 December 2015 Pages: 617 - 620