Representing simple d-dimensional polytopes by d polynomials Gennadiy AverkovMartin Henk Full Length Paper 16 April 2009 Pages: 203 - 230
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers A. F. IzmailovM. V. Solodov Full Length Paper 16 April 2009 Pages: 231 - 257
Strong KKT conditions and weak sharp solutions in convex-composite optimization Xi Yin ZhengKung Fu Ng Full Length Paper 17 April 2009 Pages: 259 - 279
On the relative strength of split, triangle and quadrilateral cuts Amitabh BasuPierre BonamiFrançois Margot Full Length Paper 23 April 2009 Pages: 281 - 314
Smoothed analysis of condition numbers and complexity implications for linear programming John DunaganDaniel A. SpielmanShang-Hua Teng Full Length Paper 05 May 2009 Pages: 315 - 350
Lifting for conic mixed-integer programming Alper AtamtürkVishnu Narayanan Full Length Paper Open access 19 May 2009 Pages: 351 - 363
Implications of the constant rank constraint qualification Shu Lu Full Length Paper 26 May 2009 Pages: 365 - 392
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints V. JeyakumarG. Y. Li Short Communication 08 May 2009 Pages: 393 - 399
An FPTAS for minimizing the product of two non-negative linear cost functions Vineet GoyalLatife Genc-KayaR. Ravi Short Communication 19 May 2009 Pages: 401 - 405