Volume 99, Number 1, January 2004
, Katya Scheinberg
: A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming.
Walter F. Mascarenhas
: The BFGS method with exact line searches fails for non-convex objective functions.
: Epsilon-proximal decomposition method.
Volume 99, Number 2, March 2004
Robert M. Freund
: Complexity of convex optimization using geometry-based measures and a reference point.
Lisa A. Korf
: Stochastic programming duality: 8 multipliers for unbounded constraints with an application to mathematical finance.
, Kim-Chuan Toh
: Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming.
Volume 99, Number 3, April 2004
: Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph.
: Duality gap in convex programming.
, Josef Stoer
: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems.