Equivalence of two nondegeneracy conditions for semidefinite programs

Journal of Optimization Theory and Applications

Volumn 135, Issue 3, 2007, Pages 381-397

  Flegel, M L ^a   Kanzow, C ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Nondegeneracy conditions; Semidefinite programs; Strict complementarity

Indexed keywords

ALGEBRAIC CONDITIONS; CONDITION; FAST CONVERGENCE; GEOMETRIC CONDITIONS; LOCAL QUADRATIC CONVERGENCE; NON-DEGENERACY; NONDEGENERACY CONDITION; SEMI-DEFINITE PROGRAM (SDP); STRICT COMPLEMENTARITY;

SENSITIVITY ANALYSIS;

EID: 36148941392     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-007-9270-5     Document Type: Article

References (28)

1. Alizadeh, F., Haeberly, J.P., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77, 111-128 (1997)
2. Kanzow, C., Nagel, C.: Quadratic convergence of a nonsmooth Newton-type method for semidefinite programs without strict complementarity. SIAM J. Optim. 15, 654-672 (2005)
3. Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996)
4. Kojima, M., Shida, M., Shindoh, S.: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Program. 80, 129-160 (1998)
5. Kojima, M., Shida, M., Shindoh, S.: A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction. SIAM J. Optim. 9, 444-465 (1999)
6. Monteiro, R.D.C.: Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions. SIAM J. Optim. 8, 797-812 (1998)
7. Nesterov, Y., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324-364 (1998)
8. Todd, M.J., Toh, K.C., Tütüncü, R.H.: On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8, 769-796 (1998)
9. Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365-386 (1998)
10. Chen, X., Tseng, P.: Non-interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95, 431-474 (2003)
11. Kanzow, C., Nagel, C.: Semidefinite programs: new search directions, smoothing-type methods, and numerical results. SIAM J. Optim. 13, 1-23 (2003). Corrigendum in SIAM J. Optim. 14, 936-937 (2004)
12. Kanzow, C., Nagel, C.: Some structural properties of a Newton-type method for semidefinite programs. J. Optim. Theory Appl. 122, 219-226 (2004)
13. Sun, D., Sun, J.: Semismooth matrix valued functions. Math. Oper. Res. 27, 150-169 (2002)
14. Sun, J., Sun, D., Qi, L.: A squared smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems. SIAM J. Optim. 14, 783-806 (2004)
15. Tseng, P.: Merit functions for semi-definite complementarity problems. Math. Program. 83, 159-185 (1998)
16. Alizadeh, F., Haeberly, J.P., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8, 746-768 (1998)
17. Haeberly, J.P.: Remarks on nondegeneracy in mixed semidefinite-quadratic programming. Technical Report, Department of Mathematics, Fordham University (1998)
18. Freund, R.W., Jarre, F.: A sensitivity result for semidefinite programs. Oper. Res. Lett. 32, 126-132 (2004)
19. Miller, S.A.: Sensitivity of solutions to semidefinite programs. Technical Report CCEC-97-0519, Center for Control Engineering and Computation, University of California, Santa Barbara (1997)
20. Nayakkankuppam, M.V., Overton, M.L.: Conditioning of semidefinite programs. Math. Program. 85, 525-540 (1999)
21. Shapiro, A., Fan, M.K.H.: On eigenvalue optimization. SIAM J. Optim. 5, 552-569 (1995)
22. Shapiro, A.: First and second order analysis of nonlinear semidefinite programs. Math. Program. 77, 301-320 (1997)
23. Pataki, G.: Cone-LP's and semidefinite programs: geometry and a simplex-type method. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) Proceedings of the Fifth IPCO Conference, pp. 161-174. Springer, Berlin (1996)
24. Pataki, G.: The geometry of semidefinite programming. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, pp. 29-66. Kluwer, Dordrecht (2000)
25. Yildirim, E.A.: An interior-point perspective on sensitivity analysis in semidefinite programming. Math. Oper. Res. 28, 649-676 (2003)
26. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
27. Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)
28. Flegel, M.L., Kanzow, C.: Equivalence of two nondegeneracy conditions for semidefinite programs. Report, Institute of Applied Mathematics and Statistics, University of Würzburg, Würzburg, Germany (2005)