Please use this identifier to cite or link to this item:
|Title:||The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications|
Nonlinear semidefinite programming
Strong second-order sufficient condition
|Citation:||Sun, D. (2006-11). The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Mathematics of Operations Research 31 (4) : 761-776. ScholarBank@NUS Repository. https://doi.org/10.1287/moor.1060.0195|
|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.|
|Source Title:||Mathematics of Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2018
WEB OF SCIENCETM
checked on May 30, 2018
checked on Jun 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.