Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 761-776 |
Number of pages | 16 |
Journal | Mathematics of Operations Research |
Volume | 31 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Nov 2006 |
Externally published | Yes |
Keywords
- Constraint nondegeneracy
- Nonlinear semidefinite programming
- Strong regularity
- Strong second-order sufficient condition
ASJC Scopus subject areas
- Mathematics(all)
- Computer Science Applications
- Management Science and Operations Research