The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

References

• Bonnans J. F., Ramírez C H. Perturbation analysis of second order cone programming problems. Math. Programming, Ser. B (2005a) 104:205–227Crossref, Google Scholar
• Bonnans J. F., Ramírez C H. Strong regularity of semidefinite programming problems. (2005b) . Techincal Report CMM-DIM B-05/06-137, Department of Mathematical Engineering, Universida de ChileGoogle Scholar
• Bonnans J. F., Shapiro A. Optimization problems with perturbations: A guided tour. SIAM Rev. (1998) 40:202–227Crossref, Google Scholar
• Bonnans J. F., Shapiro A.Perturbation Analysis of Optimization Problems (2000) (Springer, New York) Crossref, Google Scholar
• Bonnans J. F., Sulem A. Pseudopower expansion of solutions of generalized equations and constrained optimization problems. Math. Programming (1995) 70:123–148Crossref, Google Scholar
• Bonnans J. F., Cominetti R., Shapiro A. Sensitivity analysis of optimization problems under second order regularity constraints. Math. Oper. Res. (1998) 23:803–832Link, Google Scholar
• Bonnans J. F., Cominetti R., Shapiro A. Second order optimality conditions based on parabolic second order tangent sets. SIAM J. Optim. (1999) 9:466–493Crossref, Google Scholar
• Clarke F. H. On the inverse function theorem. Pacific J. Math. (1976) 64:97–102Crossref, Google Scholar
• Clarke F. H.Optimization and Nonsmooth Analysis (1983) (John Wiley and Sons, New York) Google Scholar
• Dontchev A. L., Rockafellar R. T. Characterizations of strong regularity for variational inequalities over polyhedral convex sets. SIAM J. Optim. (1996) 6:1087–1105Crossref, Google Scholar
• Eaves B. C. On the basic theorem of complementarity. Math. Programming (1971) 1:68–75Crossref, Google Scholar
• Facchinei F., Pang J. S.Finite-Dimensional Variational Inequalities and Complementarity Problems (2003) I(Springer, New York) Google Scholar
• Gauvin J. A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Programming (1977) 12:136–138Crossref, Google Scholar
• Gowda M. S. Inverse and implicit function theorems for H-differentiable and semismooth functions. Optim. Methods Software (2004) 19:443–461Crossref, Google Scholar
• Higham N. J. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Its Appl. (1988) 103:103–118Crossref, Google Scholar
• Jongen H. Th., Rückmann J., Tammer K. Implicit functions and sensitivity of stationary points. Math. Programming (1990) 49:123–138Crossref, Google Scholar
• Jongen H. Th., Mobert T., Rückmann J., Tammer K. On inertia and Schur complement in optimization. Linear Algebra Its Appl. (1987) 95:97–109Crossref, Google Scholar
• Klatte D., Kummer B.Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications (2002) (Kluwer Academic Publishers, Boston, MA) Google Scholar
• Kojima M., Robinson S. M. Strongly stable stationary solutions in nonlinear programs. Analysis and Computation of Fixed Points (1980) (Academic Press, New York) 93–138Crossref, Google Scholar
• Kummer B. Lipschitzian inverse functions, directional derivatives, and applications in C1, 1-optimization. J. Optim. Theory Appl. (1991) 70:559–580Crossref, Google Scholar
• Lloyd N. G.Degree Theory (1978) (Cambridge University Press, Cambridge, UK) Google Scholar
• Mangasarian O. L., Fromovitz S. The Fritz-John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. (1967) 7:37–47Crossref, Google Scholar
• Meng F., Sun D., Zhao G. Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Programming, Ser. B (2005) 104:561–581Crossref, Google Scholar
• Mifflin R. Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. (1977) 15:957–972Crossref, Google Scholar
• Ortega J. M., Rheinboldt W. C.Iterative Solution of Nonlinear Equations in Several Variables (1970) (Academic Press, New York) Google Scholar
• Pang J. S., Sun D., Sun J. Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems. Math. Oper. Res. (2003) 28:39–63Link, Google Scholar
• Qi L., Sun J. A nonsmooth version of Newton’s method. Math. Programming (1993) 58:353–367Crossref, Google Scholar
• Robinson S. M. Stability theory for systems of inequalities, Part I: Linear systems. SIAM J. Numer. Anal. (1975) 12:754–769Crossref, Google Scholar
• Robinson S. M. First order conditions for general nonlinear optimization. SIAM J. Appl. Math. (1976) 30:597–607Crossref, Google Scholar
• Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5:43–62Link, Google Scholar
• Robinson S. M. Local structure of feasible sets in nonlinear programming, Part II: Nondegeneracy. Math. Programming Stud. (1984) 22:217–230Crossref, Google Scholar
• Robinson S. M. Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity. Math. Programming Stud. (1987) 30:45–66Crossref, Google Scholar
• Robinson S. M. An implicit-function theorem for a class of nonsmooth functions. Math. Oper. Res. (1991) 16:292–309Link, Google Scholar
• Robinson S. M. Constraint nondegeneracy in variational analysis. Math. Oper. Res. (2003) 28:201–232Link, Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Rockafellar R. T., Wets R. J-B.Variational Analysis (1998) (Springer, New York) Crossref, Google Scholar
• Shapiro A. Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis. Psychometrika (1982) 47:187–199Crossref, Google Scholar
• Shapiro A. First and second order analysis of nonlinear semidefinite programs. Math. Programming, Ser. B (1997) 77:301–320Crossref, Google Scholar
• Shapiro A. Sensitivity analysis of generalized equations. J. Math. Sci. (2003) 115:2554–2565Crossref, Google Scholar
• Sun D., Sun J. Semismooth matrix valued functions. Math. Oper. Res. (2002) 27:150–169Link, Google Scholar
• Tseng P. Merit functions for semi-definite complementarity problems. Math. Programming (1998) 83:159–185Crossref, Google Scholar
• Zarantonello E. H., Zarantonello E. H. Projections on convex sets in Hilbert space and spectral theory I and II. Contributions to Nonlinear Functional Analysis (1971) (Academic Press, New York) 237–424Crossref, Google Scholar