Local duality of nonlinear semidefinite programming

Mathematics of Operations Research

Volumn 34, Issue 1, 2009, Pages 124-141

  Qi, Houduo ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Constraint nondegeneracy; Nonlinear semidefinite programming; Nonsingularity; Strong second order sufficient condition

Indexed keywords

CONSTRAINT NONDEGENERACY; CORRELATION MATRIX; KARUSH KUHN TUCKERS; LAGRANGIAN FUNCTIONS; NON-DEGENERACY; NONLINEAR PROGRAMS; NONLINEAR SEMIDEFINITE PROGRAMMING; NONSINGULARITY; POSITIVE DEFINITE; SECOND-ORDER SUFFICIENT CONDITIONS; SEMI-DEFINITE PROGRAMMING; STABILITY ANALYSIS; STRONG SECOND-ORDER SUFFICIENT CONDITION;

TRAJECTORIES;

EID: 67649960105     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0315     Document Type: Article

References (35)

1. Alizadeh, F., J.-P. A. Haeberly, M. L. Overton. 1997. Complementarity and nondegeneracy in semidefinite programming. Math. Programming 77 111-128.
2. Arnold, V. I. 1971. On matrices depending on parameters. Russian Math. Surveys 26 29-43.
3. Bonnans, J. F., H. Ramírez C. 2005. Strong regularity of semidefinite programming problems. Techical report, Department of Mathematical Engineering, Universida de Chile.
4. Bonnans, J. F., A. Shapiro. 1998. Nondegeneracy and quantitative stability of parameterized optimization problems with multiple solutions. SIAM J. Optim. 8 940-946.
5. Bonnans, J. F., A. Shapiro. 2000. Perturbation Analysis of Optimization Problems. Springer, New York.
6. Bonnans, J. F., R. Cominetti, A. Shapiro. 1998. Sensitivity analysis of optimization problems under second order regularity constraints. Math. Oper. Res. 23 803-832.
7. Bonnans, J. F., R. Cominetti, A. Shapiro. 1999. Second order optimality conditions based on parabolic second order tangent sets. SIAM J. Optim. 9 466-493.
8. Chan, Z. X., D. Sun. 2008. Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J. Optim. 19 370-396.
9. Clarke, F. H. 1983. Optimization and Onsmooth Analysis. John Wiley & Sons, New York.
10. Cominetti, R. 1990. Metric regularity, tangent sets and second order optimality conditions. J. Appl. Math. Optim. 21 265-287.
11. Eaves, B. C. 1971. On the basic theorem for complemenarity. Math. Programming 1 68-75.
12. Flegel, M. L., C. Kanzow. 2007. Equivalence of two nondegeneracy conditions for semidefinite programs. J. Optim. Theory Appl. 135 381-397.
13. Fujiwara, O., S.-P. Han, O. L. Mangasarian. 1984. Local duality of nonlinear programs. SIAM J. Control Optim. 22 162-169.
14. Higham, N. J. 2002. Computing the nearest correlation matrix - A problem from finance. IMA J. Numer. Anal. 22 329-343.
15. Kanzow, C., C. Nagel. 2002. Semidefinite programs: New search directions, smoothing-type methods, and numerical results. SIAM J. Optim. 13 1-23.
16. Kawasaki, H. 1988. An envelope-like effect of infinitely many inequality constraints on second order necessary conditions for minimization problems. Math. Programming 41 73-96.
17. Luenberger, D. G. 1973. Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading, MA.
18. Matsumoto, T. 2005. An algebraic condition equivalent to strong stability of stationary solutions of nonlinear positive semidefinite programms. SIAM J. Optim. 16 452-470.
19. Nie, J. W., Y. X. Yuan. 2001. A predictor-corrector algorithm for QSDP combining Dikin-type and Newton centering steps. Ann. Oper. Res. 103 115-133.
20. Pang, J.-S., D. Sun, J. Sun. 2003. Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems. Math. Oper. Res. 28 39-63.
21. Qi, L. 1993. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18 227-244.
22. Robinson, S. M. 1976. First order conditions for general nonlinear optimization. SIAM J. Appl. Math. 30 597-607.
23. Robinson, S. M. 1980. Strongly regular generalized equations. Math. Oper. Res. 5 43-62.
24. Robinson, S. M. 1984. Local structure of feasible sets in nonlinear programming, Part II: Nondegeneracy. Math. Programming Stud. 22 217-230.
25. Robinson, S. M. 2003. Constriant nondegeneracy in variational analysis. Math. Oper. Res. 28 201-232.
26. Rockafellar, R. T., R. J.-B. Wets. 1998. Variational Analysis. Springer, Berlin.
27. Shapiro, A. 1997. First and second order analysis of nonlinear semidefinite programms. Math. Programming 77 301-320.
28. Shapiro, A. 2000. Duality, optimality conditions and perturbation analysis. R. Saigal, L. Vandenberghe, H. Wolkowicz, eds. Semidefinite Programming and Applications Handbook. Kluwer Academic Publishers, Boston, 67-92.
29. Shapiro, A. 2003. Sensitivity anlaysis of generalized equations. J. Math. Sci. 115 2554-2565.
30. Shapiro, A., M. K. H. Fan. 1995. On eigenvalue optimization. SIAM J. Optim. 5 552-569.
31. Sun, D. 2006. The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31 761-776.
32. Sun, D., J. Sun. 2002. Semismooth matrix valued functions. Math. Oper. Res. 27 150-169.
33. Toh, K. C. 2008. An inexact primal-dual path-following algorithm for convex quadratic SDP. Math. Programming 112 221-254.
34. Toh, K. C., R. H. Tütüncü, M. J. Todd. 2007. Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems. Pacific J. Optim. 3 135-164.
35. Wolfe, P. 1961. A duality theorem for nonlionear programming. Quart. Appl. Math. 19 239-244.