1. On integrality ratios for asymmetric TSP in the Sherali–Adams hierarchy

   • Joseph Cheriyan
   • Zhihan Gao
   • Sahil Singla

   Full Length Paper 19 September 2015 Pages: 1 - 29

   

2. Stronger bounds and faster algorithms for packing in generalized kernel systems

   • Mario Leston-Rey
   • Orlando Lee

   Full Length Paper 24 September 2015 Pages: 31 - 80

   

3. Optimized first-order methods for smooth convex minimization

   • Donghwan Kim
   • Jeffrey A. Fessler

   Full Length Paper 17 October 2015 Pages: 81 - 107

   

4. On conic QPCCs, conic QCQPs and completely positive programs

   • Lijie Bai
   • John E. Mitchell
   • Jong-Shi Pang

   Full Length Paper 01 October 2015 Pages: 109 - 136

   

5. A dual method for minimizing a nonsmooth objective over one smooth inequality constraint

   • Ron Shefi
   • Marc Teboulle

   Full Length Paper 05 October 2015 Pages: 137 - 164

   

6. Cut generation for optimization problems with multivariate risk constraints

   • Simge Küçükyavuz
   • Nilay Noyan

   Full Length Paper 05 October 2015 Pages: 165 - 199

7. Gradient sliding for composite optimization

   • Guanghui Lan

   Full Length Paper 22 October 2015 Pages: 201 - 235

   

8. Quadratic diameter bounds for dual network flow polyhedra

   • Steffen Borgwardt
   • Elisabeth Finhold
   • Raymond Hemmecke

   Full Length Paper 17 October 2015 Pages: 237 - 251

   

9. On the ergodic convergence rates of a first-order primal–dual algorithm

   • Antonin Chambolle
   • Thomas Pock

   Full Length Paper 30 October 2015 Pages: 253 - 287

   

10. A rank-corrected procedure for matrix completion with fixed basis coefficients

    • Weimin Miao
    • Shaohua Pan
    • Defeng Sun

    Full Length Paper 30 October 2015 Pages: 289 - 338

    

11. Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem

    • Gabriel A. Carrizo
    • Pablo A. Lotito
    • María C. Maciel

    Full Length Paper 30 October 2015 Pages: 339 - 369

    

12. Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

    • Guoyin Li
    • Ting Kei Pong

    Full Length Paper 24 November 2015 Pages: 371 - 401

    

13. Convergence rates with inexact non-expansive operators

    • Jingwei Liang
    • Jalal Fadili
    • Gabriel Peyré

    Full Length Paper 30 November 2015 Pages: 403 - 434

    

14. A family of second-order methods for convex \(\ell _1\)-regularized optimization

    • Richard H. Byrd
    • Gillian M. Chin
    • Figen Oztoprak

    Full Length Paper 30 November 2015 Pages: 435 - 467

    

15. Primal and dual active-set methods for convex quadratic programming

    • Anders Forsgren
    • Philip E. Gill
    • Elizabeth Wong

    Full Length Paper 16 December 2015 Pages: 469 - 508

    

16. Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings

    • Hideaki Iiduka

    Full Length Paper 15 December 2015 Pages: 509 - 538

    

17. Sparse solutions of linear complementarity problems

    • Xiaojun Chen
    • Shuhuang Xiang

    Short Communication 01 October 2015 Pages: 539 - 556

18. A comment on “computational complexity of stochastic programming problems”

    • Grani A. Hanasusanto
    • Daniel Kuhn
    • Wolfram Wiesemann

    Short Communication 22 October 2015 Pages: 557 - 569

    

19. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets

    • Sujeevraja Sanjeevi
    • Sina Masihabadi
    • Kiavash Kianfar

    Short Communication 30 October 2015 Pages: 571 - 583

    

20. On sublinear inequalities for mixed integer conic programs

    • Fatma Kılınç-Karzan
    • Daniel E. Steffy

    Short Communication 16 February 2016 Pages: 585 - 605