Abstract
In this paper, an equivalency condition of nonsingularity in nonlinear semidefinite programming, which can be viewed as a generalization of the equivalency condition of nonsingularity for linear semidefinite programming, is established under certain conditions of convexity.
Similar content being viewed by others
References
C. Helmberg, Semidefinite programming for combrinatorial optimization. URL: http://www.zib.de/helmberg/semidef.html.
M. J. Todd, Semidefinite optimization, Acta Numerica, 2001, 10: 515–560.
L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review, 1996, 38: 49–95.
H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming, Kluwer Academic Publishers, Boston-Dordrecht-London, 2000.
J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimizations, Springer, New York, 2000.
R. W. Freund, F. Jarre, and C. H. Vogelbusch, Nonlinear semidefinite programming: Sensitivity, convergence, and an application in passive reduced-order modeling, Mathematical Programming, 2007, 109: 581–611.
C. Li and W. Sun, On filter-successive linearization methods for nonlinear semidefinite programs, Science in China Series A: Mathematics (Chinese Version), 2009, 39(8): 977–995, (English Version), 2009, 52(11).
C. Li and W. Sun, A nonsmooth Newton-type method for nonlinear semidefinite programming, Journal of Nanjing Normal University: Natural Science, 2008, 31: 1–7.
D. Sun, The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, Mathematics of Operations Research, 2006, 31: 761–776.
W. Sun and Y. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006.
Z. S. Yu, Solving semidefinite programming problems via alternating direction methods, Journal of Computational and Applied Mathematics, 2006, 193: 437–445.
R. H. Tütüncü, K. C. Toh, and M. J. Todd, Solving semidefinite quadratic-linear programs using SDPT3, Mathematical Programming, 2003, 95: 189–217.
Z. Chan and D. Sun, Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming, SIAM Journal on Optimization, 2008, 19(1): 370–396.
F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Mathematics of Operations Research, 1993, 18: 227–244.
L. Qi and J. Sun, A nonsmooth version of Newton’s method, Mathematical Programming, 1993, 58: 353–367.
D. Sun and J. Sun, Semismooth matrix value functions, Mathematics of Operations Research, 2002, 27: 150–169.
J. S. Pang, D. F. Sun, and J. Sun, Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems, Mathematics of Operations Research, 2003, 28: 39–63.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science Foundation of China under Grant No. 10871098, the Natural Science Fund of Jiangsu Province under Grant No. BK2009397, the Innovation Fund of Youth of Fujian Province under Grant No. 2009J05003 and CNPq Brazil.
Rights and permissions
About this article
Cite this article
Li, C., Sun, W. & de Sampaio, R.J.B. An equivalency condition of nonsingularity in nonlinear semidefinite programming. J Syst Sci Complex 23, 822–829 (2010). https://doi.org/10.1007/s11424-010-8057-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-010-8057-1