1. Continuous knapsack sets with divisible capacities

   • Laurence A. Wolsey
   • Hande Yaman

   Full Length Paper 17 February 2015 Pages: 1 - 20

2. A dynamic inequality generation scheme for polynomial programming

   • Bissan Ghaddar
   • Juan C. Vera
   • Miguel F. Anjos

   Full Length Paper 04 March 2015 Pages: 21 - 57

   

3. Accelerated gradient methods for nonconvex nonlinear and stochastic programming

   • Saeed Ghadimi
   • Guanghui Lan

   Full Length Paper 21 February 2015 Pages: 59 - 99

   

4. Error bounds for mixed integer linear optimization problems

   • Oliver Stein

   Full Length Paper 20 February 2015 Pages: 101 - 123

   

5. A doubly stabilized bundle method for nonsmooth convex optimization

   • Welington de Oliveira
   • Mikhail Solodov

   Full Length Paper 20 February 2015 Pages: 125 - 159

   

6. A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

   • Sunyoung Kim
   • Masakazu Kojima
   • Kim-Chuan Toh

   Full Length Paper 21 February 2015 Pages: 161 - 187

   

7. A second-order method for strongly convex \(\ell _1\)-regularization problems

   • Kimon Fountoulakis
   • Jacek Gondzio

   Full Length Paper 01 March 2015 Pages: 189 - 219

   

8. Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles

   • Anatoli Juditsky
   • Arkadi Nemirovski

   Full Length Paper 22 March 2015 Pages: 221 - 256

9. A nonsmooth Robinson’s inverse function theorem in Banach spaces

   • R. Cibulka
   • A. L. Dontchev

   Full Length Paper 03 March 2015 Pages: 257 - 270

10. Generalized Gauss inequalities via semidefinite programming

    • Bart P. G. Van Parys
    • Paul J. Goulart
    • Daniel Kuhn

    Full Length Paper 12 March 2015 Pages: 271 - 302

    

11. The convex recoloring problem: polyhedra, facets and computational experiments

    • Manoel Campêlo
    • Alexandre S. Freire
    • Yoshiko Wakabayashi

    Full Length Paper 04 March 2015 Pages: 303 - 330

    

12. The projected faces property and polyhedral relations

    • Michele Conforti
    • Kanstantsin Pashkovich

    Full Length Paper 06 March 2015 Pages: 331 - 342

    

13. Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming

    • Steffen Rebennack

    Full Length Paper 31 March 2015 Pages: 343 - 389

    

14. Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization

    • Jun-ya Gotoh
    • Stan Uryasev

    Full Length Paper 08 April 2015 Pages: 391 - 431

    

15. Parallel coordinate descent methods for big data optimization

    • Peter Richtárik
    • Martin Takáč

    Full Length Paper Open access 12 April 2015 Pages: 433 - 484

    

16. Spectral simplex method

    • Vladimir Yu. Protasov

    Full Length Paper 09 April 2015 Pages: 485 - 511

17. S-lemma with equality and its applications

    • Yong Xia
    • Shu Wang
    • Ruey-Lin Sheu

    Full Length Paper 25 April 2015 Pages: 513 - 547

18. Variable metric random pursuit

    • S. U. Stich
    • C. L. Müller
    • B. Gärtner

    Full Length Paper 24 May 2015 Pages: 549 - 579

    

19. A search for quantum coin-flipping protocols using optimization techniques

    • Ashwin Nayak
    • Jamie Sikora
    • Levent Tunçel

    Full Length Paper 15 May 2015 Pages: 581 - 613

20. A semi-definite programming approach for robust tracking

    • Shimrit Shtern
    • Aharon Ben-Tal

    Full Length Paper 28 May 2015 Pages: 615 - 656