Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 14 (2) , 307-333
- https://doi.org/10.1137/s1052623402401804
Abstract
No abstract availableAll Related Versions
This publication has 17 references indexed in Scilit:
- A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision MachineSIAM Journal on Optimization, 2002
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear SystemsSIAM Journal on Optimization, 2002
- Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite ProgramSIAM Journal on Optimization, 2001
- 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
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid AlgorithmSIAM Journal on Optimization, 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
- Some perturbation theory for linear programmingMathematical Programming, 1994