On the generic properties of convex optimization problems in conic form

Mathematical Programming, Series B

Volumn 89, Issue 3, 2001, Pages 449-457

  Pataki, Gábor ^a   Tunçel, Levent ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Convex optimization; Nondegeneracy; Strict complementarity

Indexed keywords

EID: 14644395821     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011408     Document Type: Article

References (18)

1. Alizadeh, F., Haeberly, J.-P.A., Overton, M. (1997): Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77, 111-128
2. Brondsted, A. (1983): An Introduction to Convex Polytopes. Springer-Verlag, New York, NY
3. Ewald, G., Larman, D.G., Rogers, C.A. (1970): The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space. Mathematika 17, 1-20
4. Faraut, J., Korányi, A. (1994): Analysis on Symmetric Cones. Oxford University Press, New York, NY
5. Halmos, P.R. (1950): Measure Theory. D. Van Nostrand Company Inc., New York, NY
6. Kojima, M., Shida, M., Shindoh, S. (1998): Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Program. 80, 129-160
7. Larman, D.G. (1971): On a conjecture of Klee and Martin for convex bodies. Proc. London Math. Soc. 23, 668-682. Corrigendum (1978): 36, 86
8. Larman, D.G., Rogers, C.A. (1970): Paths in the one-skeleton of a convex body. Mathematika 17, 293-314
9. Larman, D.G., Rogers, C.A. (1971): Increasing paths on the one-skeleton of a convex body and the directions of line segments on the boundary of a convex body. Proc. London Math. Soc. 23, 683-698
10. Luo, Z.-Q., Sturm, J.F., Zhang, S. (1998): Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8, 59-81
11. Nesterov, Yu.E., Nemirovskii, A.S. (1994): Interior-point polynomial algorithms in convex programming. SIAM Publications, Philadelphia, PA
12. Pataki, G. (1996): Cone LP's and semidefinite programs: Geometry and a simplex type method. Proc. Fifth IPCO Conference, Cunningham, W.H., McCormick, S.T., Queyranne, M., eds., Springer-Verlag, pp. 161-174
13. Potra, F.A., Sheng, R. (1998): A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8, 1007-1028
14. Rockafellar, R.T. (1970): Convex Analysis. Princeton University Press, Princeton, NJ
15. Rogers, C.A. (1970): Hausdorff Measures. Cambridge University Press, Cambridge, United Kingdom
16. Renegar, J.: private communication, March and April 1996
17. Schneider, R. (1993): Convex Bodies: The Brunn-Minkowski Theory. Cambridge University Press, Cambridge, United Kingdom
18. Shapiro, A. (1997): First and second order analysis of nonlinear semidefinite programs. Math. Program. 77, 301-320