1. Representing simple d-dimensional polytopes by d polynomials

   • Gennadiy Averkov
   • Martin Henk

   Full Length Paper 16 April 2009 Pages: 203 - 230

2. On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers

   • A. F. Izmailov
   • M. V. Solodov

   Full Length Paper 16 April 2009 Pages: 231 - 257

3. Strong KKT conditions and weak sharp solutions in convex-composite optimization

   • Xi Yin Zheng
   • Kung Fu Ng

   Full Length Paper 17 April 2009 Pages: 259 - 279

4. On the relative strength of split, triangle and quadrilateral cuts

   • Amitabh Basu
   • Pierre Bonami
   • François Margot

   Full Length Paper 23 April 2009 Pages: 281 - 314

5. Smoothed analysis of condition numbers and complexity implications for linear programming

   • John Dunagan
   • Daniel A. Spielman
   • Shang-Hua Teng

   Full Length Paper 05 May 2009 Pages: 315 - 350

6. Lifting for conic mixed-integer programming

   • Alper Atamtürk
   • Vishnu Narayanan

   Full Length Paper Open access 19 May 2009 Pages: 351 - 363

7. Implications of the constant rank constraint qualification

   • Shu Lu

   Full Length Paper 26 May 2009 Pages: 365 - 392

8. Necessary global optimality conditions for nonlinear programming problems with polynomial constraints

   • V. Jeyakumar
   • G. Y. Li

   Short Communication 08 May 2009 Pages: 393 - 399

9. An FPTAS for minimizing the product of two non-negative linear cost functions

   • Vineet Goyal
   • Latife Genc-Kaya
   • R. Ravi

   Short Communication 19 May 2009 Pages: 401 - 405