Two properties of condition numbers for convex programs via implicitly defined barrier functions

Mathematical Programming, Series B

Volumn 93, Issue 1, 2002, Pages 55-75

  Peña, Javier ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; OPTIMIZATION;

BARRIER FUNCTIONS; CONVEX PROGRAMS; INTERIOR-POINT ALGORITHMS;

NUMBER THEORY;

EID: 30944470060     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070200294     Document Type: Article

References (19)

1. Alizadeh, F., Haeberly, J., Overtoil, M. (1998): Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results. SIAM Journal on Optimization 8, 746-768
2. Dontchev, A.L., Lewis, A.S., Rockafellar, R.T.: The radius of metric regularity. Submitted to Transactions of the AMS
3. Freund, R., Vera, J. (1999): Some Characterization and Properties of the 'Distance to Ill-posedness' and the Condition Measure of a Conic Linear System. Mathematical Programming 86, 225-260
4. Freund, R., Vera, J. (1999): Condition-based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm. SIAM Journal on Optimization 10, 155-176
5. Kojima, M., Megiddo, N., Mizuno, S., Shindoh, S. (1994): Decomposition in interior-point methods. B-281, Department of Informations Sciences, Tokyo Institute of Technology, Tokyo 152-8552
6. Lewis, A. (1999): Ill-conditioned convex processes and linear inequalities. Mathematics of Operations Research 24, 829-834
7. Nesterov, Y., Nemirovskii, A. (1994): Interior-Point Polynomial Algorithms in Convex Programmina. SIAM, Philadelphia
8. Nesterov, Y., Todd, M.J. (1997): Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research 22, 1-42
9. Nesterov, Y., Todd, M.J. (1998): Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization 8, 324-364
10. Nunez, M., Freund, R. (1998): Condition Measures and Properties of the Central Trajectory of a Linear Program. Mathematical Programming 83, 1-28
11. Overton, M., Private Communication
12. Peña, J. (2000): Understanding the Geometry on Infeasible Perturbations of a Conic Linear System. SIAM Journal on Optimization 10, 534-550
13. Peña, J. (2001): Conditioning of Convex Programs from a Primal-Dual Perspective. Mathematics of Operations Research 26, 206-220
14. Pena, J., Renegar, J. (2000): Computing Approximate Solutions for Conic Systems of Constraints. Mathematical Programming 87, 351-383
15. Renegar, J. (1995): Linear Programming, Complexity Theory and Elementary Functional Analysis. Mathematical Programming 70, 279-351
16. Renegar, J. (1996): Condition Numbers, the Barrier Method and the Conjugate Gradient Method. SIAM Journal on Optimization 6, 879-912
17. Renegar, J. (2001): A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia
18. Rudin, W. (1976): Principles of Mathematical Analysis. Third Edition, McGraw Hill
19. Todd, M., Toh, K., Tütüncü, R. (1998): On the Nesterov-Todd Direction in Semidefinite Programming. SIAM Journal on Optimization 8, 769-796