47

Some Characterizations And Properties Of The "Distance To IllPosedness" And The Condition Measure Of A Conic Linear System
–
 1998

71

Some Perturbation Theory for Linear Programming
–
 1992

4

On two measures of problem complexity and their explanatory value for the performance of SeDuMi on secondorder cone problems
–
 2004

87

Linear Programming, Complexity Theory and Elementary Functional Analysis
–
 1995

16

SDPT3  a MATLAB software package for semidefinitequadraticlinear programming, version 3.0
–
 2001

38

ConditionBased Complexity Of Convex Optimization In Conic Linear Form Via The Ellipsoid Algorithm
–
 1998

19

A New Condition Measure, PreConditioners, and Relations between Different Measures of Conditioning for Conic Linear Systems
–
 2001

473

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
–
 1993

135

A Mathematical View of Interiorpoint Methods for Convex Optimization
–
 2001

9

A characterization of stability in linear programming
–
 1977

16

Complexity of Convex Optimization Using GeometryBased Measures and a Reference Point
–
 2002

37

A centered projective algorithm for linear programming
–
 1990

21

Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
–

87

An O( √ nL)iteration homogeneous and selfdual linear programming algorithm
–
 1994

162

Selfscaled barriers and interiorpoint methods for convex programming
–
 1997

56

A simplified homogeneous and selfdual linear programming algorithm and its implementation
–
 1996

27

Toward probabilistic analysis of interiorpoint algorithms for linear programming
–
 1994

14

On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
–
 2001

16

Superlinear Convergence of InteriorPoint Algorithms for Semidefinite Programming
–
 1996
