A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 12 (3) , 627-655
- https://doi.org/10.1137/s1052623400373829
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Computing approximate solutions for convex conic systems of constraintsMathematical Programming, 2000
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear SystemSIAM Journal on Optimization, 2000
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hardMathematical Programming, 1999
- On the condition numbers for polyhedra in Karmarkar's formOperations Research Letters, 1999
- On the Complexity of Solving Feasible Linear Programs Specified with Approximate DataSIAM Journal on Optimization, 1999
- Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear systemMathematical Programming, 1999
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear ProgramsSIAM Journal on Optimization, 1996
- Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingSIAM Journal on Optimization, 1995
- Condition numbers for polyhedra with real number dataOperations Research Letters, 1995
- Bounds for error in the solution set of a perturbed linear programLinear Algebra and its Applications, 1973