An equivalent problem in nonconvex semidefinite programming

MaRDI QIDQ3402585zbMATH OpenFDO

Authors Yonghong Ren

Publication date 12 February 2010

zbMATH Keywords

equivalentnonconvex semidefinite optimizationstrict complementarity condition

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Recommendations

• Optimality conditions for nonconvex semidefinite programming
• An equivalency condition of nonsingularity in nonlinear semidefinite programming
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• A new nonlinear Lagrangian method for nonconvex semidefinite programming
• Equivalence of two nondegeneracy conditions for semidefinite programs

Cited in

(4)

• A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
• scientific article; zbMATH DE number 3887459 (Why is no real title available?)
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs

This page was built for publication: An equivalent problem in nonconvex semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402585)