Linear, Cone and Semidefinite Programming Submissions - 2000

August 2000

A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization
J Peng, C Roos, T Terlaky

Semi-definite Programming
A scaled Gauss-Newton Primal--Dual Search Direction for Semidefinite Optimization
E. de Klerk, J Peng, C Roos, T Terlaky

Linear Programming
Warm start strategies in interior-point methods for linear programming
E. Alper Yildirim, Stephen J. Wright

Linear Programming
Notes on the Dual Simplex Method
Robert Fourer

November 2000

Linear Programming
Hyper-sparsity in the revised simplex method and how to exploit it
Julian Hall, Ken McKinnon

Other
Augmented self concordant barriers and nonlinear optimization problems with finite complexity
Yurii Nesterov, Jean-Philippe Vial

December 2000

Second-Order Cone Programming
On implementing a primal-dual interior-point method for conic quadratic optimization
Erling Andersen, Cees Roos, Tamas Terlaky