| Article ID: | iaor200948534 |
| Country: | United States |
| Volume: | 31 |
| Issue: | 4 |
| Start Page Number: | 761 |
| End Page Number: | 776 |
| Publication Date: | Nov 2006 |
| Journal: | Mathematics of Operations Research |
| Authors: | Sun Defeng |
| Keywords: | programming (semidefinite) |
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.