Computing approximate solutions for convex conic systems of constraints

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 351-383

  Pena J ^a   Renegar, J ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000171725     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050001     Document Type: Article

References (13)

1. Epelman, M., Freund, R.M. (1997): Condition number complexity of an elementary algorithm for resolving a conic linear system. Technical report, Sloan School of Management, MIT
2. Filipowski, S. (1995): On the complexity of solving feasible systems of linear inequalities specified with approximate data. Math. Program. 71, 259-288
3. Lewis, A.: Ill-conditioned convex processes and linear inequalities. To appear in Math. Oper. Res.
4. Freund, R.M., Nunez, M. (1998): Condition measures and properties of the central trajectory of a linear program. Math. Program. 83, 1-28
5. Freund, R.M., Vera, J. (1999): Some characterizations and properties of the 'distance to ill-posedness' and the condition measure of a conic linear system. Math. Program. 86, 225-260
6. Nesterov, Y., Nemirovskii, A. (1994): Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia
7. Nesterov, Y., Todd, M.J. (1997): Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1-42
8. Peña, J.: Understanding the geometry of infeasible perturbations of a conic linear system. To appear in SIAM J. Optim.
9. Renegar, J. (1994): Some perturbation theory for linear programming. Math. Program. 65, 73-91
10. Renegar, J. (1995): Linear programming, complexity theory and elementary functional analysis. Math. Program. 70, 279-351
11. Renegar, J. (1996): Condition numbers, the barrier method and the conjugate gradient method. SIAM J. Optim. 6, 879-912
12. Renegar, J. (2000): A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia
13. Vera, J. (1996): Ill-posedness and the complexity of deciding existence of solutions to linear programs. SIAM J. Optim. 6, 549-569