Optimality criteria without constraint qualifications for linear semidefinite problems
From MaRDI portal
(Redirected from Publication:690528)
Recommendations
- A practical optimality condition without constraint qualifications for nonlinear programming
- Optimality conditions in semidefinite programming
- Optimality conditions for nonconvex semidefinite programming
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- scientific article; zbMATH DE number 5662944
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- scientific article; zbMATH DE number 7546024
Cites work
- scientific article; zbMATH DE number 1186925 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A simplified test for optimality
- Characterizations of optimality without constraint qualification for the abstract convex program
- Extremal problems on the set of nonnegative definite matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On the algorithm of determination of immobile indices for convex SIP problems
- Optimality conditions for convex semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite programming for discrete optimization and matrix completion problems
- Some results about the facial geometry of convex semi-infinite systems
- Strong Duality for Semidefinite Programming
- Sufficient optimality conditions for convex semi-infinite programming
Cited in
(10)- An exact explicit dual for the linear copositive programming problem
- On the algorithm of determination of immobile indices for convex SIP problems
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- On strong duality in linear copositive programming
- Optimality conditions in semidefinite programming
- Linear semidefinite programming problems: regularisation and strong dual formulations
This page was built for publication: Optimality criteria without constraint qualifications for linear semidefinite problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690528)
