Abstract
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, we show that the nonsingularity of Clarke's Jacobian of the Fischer-Burmeister (FB) nonsmooth system is equivalent to the strong regularity of the Karush- Kuhn-Tucker point. Consequently, from Sun's paper [Math. Oper. Res., 31 (2006), pp. 761-776] the semismooth Newton method applied to the FB system may attain the locally quadratic convergence under the strong second order sufficient condition and constraint nondegeneracy.
Original language | English |
---|---|
Pages (from-to) | 1392-1417 |
Number of pages | 26 |
Journal | SIAM Journal on Optimization |
Volume | 21 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2011 |
Keywords
- Clarke's Jacobian
- Nonlinear semidefinite programming problem
- Nonsingularity
- Strong regularity
- The FB system
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Applied Mathematics