Optimality criteria without constraint qualifications for linear semidefinite problems
The authors develop optimality conditions for convex semi-infinite programming problems, and in particular for linear semidefinite programming (SDP). The first-order conditions are geometric in nature, and they do not rely on standard constraint qualifications.
scientific article; zbMATH DE number 6110731
scientific article