1. Totally unimodular stochastic programs

   • Nan Kong
   • Andrew J. Schaefer
   • Shabbir Ahmed

   Full Length Paper 21 March 2012 Pages: 1 - 13

2. Simulation-based confidence bounds for two-stage stochastic programs

   • Peter W. Glynn
   • Gerd Infanger

   Full Length Paper 16 February 2013 Pages: 15 - 42

3. Polyhedron of triangle-free simple 2-matchings in subcubic graphs

   • David Hartvigsen
   • Yanjun Li

   Full Length Paper 08 February 2012 Pages: 43 - 82

4. An interior point method in function space for the efficient solution of state constrained optimal control problems

   • Anton Schiela

   Full Length Paper 06 October 2012 Pages: 83 - 114

   

5. Iteration-complexity of first-order penalty methods for convex programming

   • Guanghui Lan
   • Renato D. C. Monteiro

   Full Length Paper 06 September 2012 Pages: 115 - 139

6. Fine tuning Nesterov’s steepest descent algorithm for differentiable convex programming

   • Clóvis C. Gonzaga
   • Elizabeth W. Karas

   Full Length Paper 05 May 2012 Pages: 141 - 166

7. Risk-averse feasible policies for large-scale multistage stochastic linear programs

   • Vincent Guigues
   • Claudia Sagastizábal

   Full Length Paper 04 October 2012 Pages: 167 - 198

   

8. Stochastic binary problems with simple penalties for capacity constraints violations

   • B. Fortz
   • M. Labbé
   • M. Poss

   Full Length Paper 11 March 2012 Pages: 199 - 221

9. Regularization methods for optimization problems with probabilistic constraints

   • Darinka Dentcheva
   • Gabriela Martinez

   Full Length Paper 28 April 2012 Pages: 223 - 251

10. A hierarchy of bounds for stochastic mixed-integer programs

    • Burhaneddin Sandıkçı
    • Nan Kong
    • Andrew J. Schaefer

    Full Length Paper 15 March 2012 Pages: 253 - 272

11. Cyclic group blocking polyhedra

    • Sangho Shim
    • Ellis L. Johnson

    Full Length Paper 03 April 2012 Pages: 273 - 307

12. Solving bilevel programs with the KKT-approach

    • Gemayqzel Bouza Allende
    • Georg Still

    Full Length Paper Open access 03 April 2012 Pages: 309 - 332

13. Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization

    • Masakazu Kojima
    • Makoto Yamashita

    Full Length Paper 10 February 2012 Pages: 333 - 364

14. Copositivity detection by difference-of-convex decomposition and ω-subdivision

    • Immanuel M. Bomze
    • Gabriele Eichfelder

    Full Length Paper 20 May 2012 Pages: 365 - 400

15. The matricial relaxation of a linear matrix inequality

    • J. William Helton
    • Igor Klep
    • Scott McCullough

    Full Length Paper 20 March 2012 Pages: 401 - 445

16. The bilevel programming problem: reformulations, constraint qualifications and optimality conditions

    • S. Dempe
    • A. B. Zemkoho

    Full Length Paper 05 January 2012 Pages: 447 - 473

17. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives

    • M. J. D. Powell

    Full Length Paper 26 January 2012 Pages: 475 - 500

18. A perfect example for the BFGS method

    • Yu-Hong Dai

    Full Length Paper 22 March 2012 Pages: 501 - 530

19. Explicit convex and concave envelopes through polyhedral subdivisions

    • Mohit Tawarmalani
    • Jean-Philippe P. Richard
    • Chuanhui Xiong

    Full Length Paper 31 July 2012 Pages: 531 - 577

20. Newton iterations in implicit time-stepping scheme for differential linear complementarity systems

    • Xiaojun Chen
    • Shuhuang Xiang

    Full Length Paper 14 March 2012 Pages: 579 - 606