1. Complexity of convex optimization using geometry-based measures and a reference point

   • Robert M. Freund

   OriginalPaper 28 May 2003 Pages: 197 - 221

2. On unions and dominants of polytopes

   • Egon Balas
   • Alexander Bockmayr
   • Laurence Wolsey

   OriginalPaper 01 September 2003 Pages: 223 - 239

3. Stochastic programming duality: ^∞ multipliers for unbounded constraints with an application to mathematical finance

   • Lisa A. Korf

   OriginalPaper 24 April 2003 Pages: 241 - 259

4. Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

   • Guanglu Zhou
   • Kim-Chuan Toh

   OriginalPaper 07 May 2003 Pages: 261 - 282

5. Safe bounds in linear and mixed-integer linear programming

   • Arnold Neumaier
   • Oleg Shcherbina

   OriginalPaper 28 May 2003 Pages: 283 - 296

6. Convex approximations for complete integer recourse models

   • Maarten H. van der Vlerk

   OriginalPaper 08 August 2003 Pages: 297 - 310

7. Coderivatives in parametric optimization

   • Adam B. Levy
   • Boris S. Mordukhovich

   OriginalPaper 01 September 2003 Pages: 311 - 327

8. Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints

   • Darinka Dentcheva
   • Andrzej Ruszczyński

   OriginalPaper 08 August 2003 Pages: 329 - 350

9. Adjustable robust solutions of uncertain linear programs

   • A. Ben-Tal
   • A. Goryashko
   • A. Nemirovski

   OriginalPaper 08 August 2003 Pages: 351 - 376

10. On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

    • Nobuo Yamashita
    • Hiroshige Dan
    • Masao Fukushima

    OriginalPaper 08 August 2003 Pages: 377 - 397