Mathematical Programming, Volume 99

Volume 99, Number 1, January 2004

• Donald Goldfarb, K. Scheinberg:
  A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. 1-34
  
• Hande Y. Benson, David F. Shanno, Robert J. Vanderbei:
  Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing. 35-48
  
• Walter F. Mascarenhas:
  The BFGS method with exact line searches fails for non-convex objective functions. 49-61
  
• Stavros G. Kolliopoulos, Clifford Stein:
  Approximating disjoint-path problems using packing integer programs. 63-87
  
• Adam Ouorou:
  Epsilon-proximal decomposition method. 89-108
  
• Samer Takriti, Shabbir Ahmed:
  On robust optimization of two-stage systems. 109-126
  
• Richard H. Byrd, Marcelo Marazzi, Jorge Nocedal:
  On the convergence of Newton iterations to non-stationary points. 127-148
  
• Yu. Nesterov, Jean-Philippe Vial:
  Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. 149-174
  
• Dennis Cheung, Felipe Cucker:
  Solving linear programs with finite precision: I. Condition numbers and random programs. 175-196
  

Volume 99, Number 2, March 2004

• Robert M. Freund:
  Complexity of convex optimization using geometry-based measures and a reference point. 197-221
  
• Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey:
  On unions and dominants of polytopes. 223-239
  
• Lisa A. Korf:
  Stochastic programming duality: ⁸ multipliers for unbounded constraints with an application to mathematical finance. 241-259
  
• Guanglu Zhou, Kim-Chuan Toh:
  Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming. 261-282
  
• Arnold Neumaier, Oleg Shcherbina:
  Safe bounds in linear and mixed-integer linear programming. 283-296
  
• Maarten H. van der Vlerk:
  Convex approximations for complete integer recourse models. 297-310
  
• Adam B. Levy, Boris S. Mordukhovich:
  Coderivatives in parametric optimization. 311-327
  
• Darinka Dentcheva, Andrzej Ruszczynski:
  Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints. 329-350
  
• Aharon Ben-Tal, A. Goryashko, E. Guslitzer, Arkadi Nemirovski:
  Adjustable robust solutions of uncertain linear programs. 351-376
  
• Nobuo Yamashita, Hiroshige Dan, Masao Fukushima:
  On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm. 377-397
  

Volume 99, Number 3, April 2004

• Uwe Naumann:
  Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. 399-421
  
• Zheng-Hai Huang, Liqun Qi, Defeng Sun:
  Sub-quadratic convergence of a smoothing Newton algorithm for the P ₀- and monotone LCP. 423-441
  
• Alper Atamtürk, Juan Carlos Muñoz:
  A study of the lot-sizing polytope. 443-465
  
• Jean-Pierre Dussault:
  Augmented non-quadratic penalty algorithms. 467-486
  
• T. Champion:
  Duality gap in convex programming. 487-498
  
• Martin Preiß, Josef Stoer:
  Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems. 499-520
  
• Kung Fu Ng, Wei Hong Yang:
  Regularities and their relations to error bounds. 521-538
  
• Kazuo Murota, Akihisa Tamura:
  Proximity theorems of discrete convex functions. 539-562
  
• Mohit Tawarmalani, Nikolaos V. Sahinidis:
  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. 563-591