A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems

SIAM Journal on Optimization

Volumn 12, Issue 3, 2002, Pages 627-655

  Epelman, Marina ^a   Freund, Robert M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Complexity of convex programming; Conditioning; Preconditioners

Indexed keywords

EID: 0036353324     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400373829     Document Type: Article

References (39)

1. The ellipsoid method: A survey
2. Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
3. On the complexity of solving sparse symmetric linear programs specified with approximate data
4. On the complexity of solving feasible linear programs specified with approximate data
5. Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system
6. Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
7. Extremum problems with inequalities as subsidiary conditions
8. A new polynomial-time algorithm for linear programming
9. A polynomial algorithm in linear programming
10. How good is the simplex algorithm?
11. A modified layered-step interior-point algorithm for linear programming
12. Condition measures and properties of the central trajectory of a linear program
13. Understanding the geometry of infeasible perturbations of a conic linear system
14. Computing approximate solutions for conic systems of constraints
15. A polynomial-time algorithm, based on Newnton's method, for linear programming
16. Some perturbation theory for linear programming
17. Incorporating condition measures into the complexity theory of linear programming
18. Linear programming, complexity theory, and elementary functional analysis
19. Bounds for error in the solution set of a perturbed linear program
20. Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
21. Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
22. On the condition numbers for polyhedra in Karmarkar's form
23. Condition numbers for polyhedra with real number data
24. A primal-dual interior point method whose running time depends only on the constraint matrix
25. A simplification to "a primal-dual interior point method whose running time depends only on the constraint matrix"
26. Ill-posedness and the complexity of deciding existence of solutions to linear programs
27. On the complexity of linear programming under finite precision arithmetic