For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equivalent: the strong second-order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke's Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others. © 2006 INFORMS.
- Constraint nondegeneracy
- Nonlinear semidefinite programming
- Strong regularity
- Strong second-order sufficient condition
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research