1. Distributionally robust multi-item newsvendor problems with multimodal demand distributions

   • Grani A. Hanasusanto
   • Daniel Kuhn
   • Steve Zymler

   Full Length Paper 24 April 2014 Pages: 1 - 32

   

2. Attraction of Newton method to critical Lagrange multipliers: fully quadratic case

   • A. F. Izmailov
   • E. I. Uskov

   Full Length Paper 10 April 2014 Pages: 33 - 73

   

3. Conditional gradient algorithms for norm-regularized smooth convex optimization

   • Zaid Harchaoui
   • Anatoli Juditsky
   • Arkadi Nemirovski

   Full Length Paper 18 April 2014 Pages: 75 - 112

   

4. A new warmstarting strategy for the primal-dual column generation method

   • Jacek Gondzio
   • Pablo González-Brevis

   Full Length Paper 22 May 2014 Pages: 113 - 146

   

5. Efficient cost-sharing mechanisms for prize-collecting problems

   • A. Gupta
   • J. Könemann
   • G. Schäfer

   Full Length Paper 23 April 2014 Pages: 147 - 188

   

6. On the geometric rank of matching polytope

   • Ashwin Arulselvan

   Full Length Paper 24 April 2014 Pages: 189 - 200

   

7. An adaptive augmented Lagrangian method for large-scale constrained optimization

   • Frank E. Curtis
   • Hao Jiang
   • Daniel P. Robinson

   Full Length Paper 30 April 2014 Pages: 201 - 245

   

8. Assigning sporadic tasks to unrelated machines

   • Alberto Marchetti-Spaccamela
   • Cyriel Rutten
   • Andreas Wiese

   Full Length Paper 14 May 2014 Pages: 247 - 274

   

9. Evaluating policies in risk-averse multi-stage stochastic programming

   • Václav Kozmík
   • David P. Morton

   Full Length Paper 13 May 2014 Pages: 275 - 300

   

10. Generalized decision rule approximations for stochastic programming via liftings

    • Angelos Georghiou
    • Wolfram Wiesemann
    • Daniel Kuhn

    Full Length Paper 25 May 2014 Pages: 301 - 338

    

11. Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods

    • Yair Censor
    • Daniel Reem

    Full Length Paper 29 May 2014 Pages: 339 - 380

    

12. Universal gradient methods for convex optimization problems

    • Yu Nesterov

    Full Length Paper 28 May 2014 Pages: 381 - 404

13. An augmented Lagrangian method for distributed optimization

    • Nikolaos Chatzipanagiotis
    • Darinka Dentcheva
    • Michael M. Zavlanos

    Full Length Paper 05 September 2014 Pages: 405 - 434

    

14. A framework of discrete DC programming by discrete convex analysis

    • Takanori Maehara
    • Kazuo Murota

    Full Length Paper 02 July 2014 Pages: 435 - 466

    

15. Globally convergent evolution strategies

    • Y. Diouane
    • S. Gratton
    • L. N. Vicente

    Full Length Paper 22 July 2014 Pages: 467 - 490

    

16. On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

    • Geovani N. Grapiglia
    • Jinyun Yuan
    • Ya-xiang Yuan

    Full Length Paper 22 July 2014 Pages: 491 - 520

17. Extreme point inequalities and geometry of the rank sparsity ball

    • D. Drusvyatskiy
    • S. A. Vavasis
    • H. Wolkowicz

    Full Length Paper 07 August 2014 Pages: 521 - 544

    

18. Sandwich games

    • Ehud Lehrer
    • Roee Teper

    Full Length Paper 01 August 2014 Pages: 545 - 557

19. A generalization of Löwner-John’s ellipsoid theorem

    • Jean B. Lasserre

    Full Length Paper 05 August 2014 Pages: 559 - 591

    

20. A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties

    • Jiming Peng
    • Tao Zhu

    Full Length Paper 07 August 2014 Pages: 593 - 614

    

21. On the complexity analysis of randomized block-coordinate descent methods

    • Zhaosong Lu
    • Lin Xiao

    Full Length Paper 01 August 2014 Pages: 615 - 642

    

22. Sufficiency of cut-generating functions

    • Gérard Cornuéjols
    • Laurence Wolsey
    • Sercan Yıldız

    Short Communication 19 April 2014 Pages: 643 - 651