Understanding the geometry of infeasible perturbations of a conic linear system

SIAM Journal on Optimization

Volumn 10, Issue 2, 1999, Pages 534-550

  Peña, Javier ^a,b  

^a Department of Obstetrics Gynecology   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Condition number; Conic systems; Convex programming; Distance to infeasibility; Singular values

Indexed keywords

EID: 0039604711     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/s1052623497323674     Document Type: Article

References (8)

1. S. FILIPOWSKI, On the complexity of solving sparse symmetric linear progrmas specified with approximate date, Math. Oper. Res., 22 (1997), pp. 769-792.
2. R. FREUND AND M. NUNEZ, Condition measures and properties of the central trajectory of a linear program, Math. Programming, 83 (1998), pp. 1-28.
3. R. FREUND AND J. VERA, Some characterizations and properties of the "Distance to Ill-posedness" and the condition measure of a conic linear system, Math. Programming, to appear.
4. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, 1997.
5. J. RENEGAR, Some perturbation theory for linear programming, Math. Programming, 65 (1994), pp. 73-92.
6. J. RENEGAR, Linear programming, complexity theory and elementary functional analysis, Math. Programming, 70 (1995), pp. 279-351.
7. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
8. G. STEWART AND J. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.