Abstract.
This paper concerns nonlinear semidefinite programming problems for which no convexity assumptions can be made. We derive first- and second-order optimality conditions analogous to those for nonlinear programming. Using techniques similar to those used in nonlinear programming, we extend existing theory to cover situations where the constraint matrix is structurally sparse. The discussion covers the case when strict complementarity does not hold. The regularity conditions used are consistent with those of nonlinear programming in the sense that the conventional optimality conditions for nonlinear programming are obtained when the constraint matrix is diagonal.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: May 15, 1998 / Accepted: April 12, 2000¶Published online May 12, 2000
Rights and permissions
About this article
Cite this article
Forsgren, A. Optimality conditions for nonconvex semidefinite programming. Math. Program. 88, 105–128 (2000). https://doi.org/10.1007/PL00011370
Issue Date:
DOI: https://doi.org/10.1007/PL00011370