AN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE PROGRAMMING  

作　　者：Chengjin LI Wenyu SUN Raimundo J. B. de SAMPAIO 

机构地区：[1]School of Mathematical Sciences, Nanjing Normal and Computer Science, Fujian Normal University, Wenyu SUN University, Nanjing 210046, China [2]School of Mathematics Fuzhou 350007, China [3]School of Mathematical Sciences, Nanjing Normal University, Nanjing 210046, China [4]Pontifical Catholic University of Parana ( PUCPR), Graduate Program in Production and Systems Engineering (PPGEPS), CEP 81611-970 Curitiba, Parana, Brazil

出　　处：《Journal of Systems Science & Complexity》2010年第4期822-829,共8页系统科学与复杂性学报（英文版）

基　　金：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

摘　　要：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 linearsemidefinite programming,is established under certain conditions of convexity.

关 键 词：Equivalency condition of nonsingularity nonlinear semidefinite programming semidefinite programming. 

分 类 号：O151.21[理学—数学] O221[理学—基础数学]