Optimality criteria without constraint qualifications for linear semidefinite problems

DOI10.1007/s10958-012-0734-2zbMath1263.90055OpenAlexW1983769620WikidataQ57677642 ScholiaQ57677642MaRDI QIDQ690528

O. I. Kostyukova, Tatiana V. Tchemisova

Publication date: 28 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/8433

zbMATH Keywords

optimality conditions

Mathematics Subject Classification ID

Semidefinite programming (90C22) Semi-infinite programming (90C34)

Related Items

On strong duality in linear copositive programming ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ An exact explicit dual for the linear copositive programming problem ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite programming for discrete optimization and matrix completion problems
• Extremal problems on the set of nonnegative definite matrices
• A simplified test for optimality
• Semi-Infinite Programming: Theory, Methods, and Applications
• Some results about the facial geometry of convex semi-infinite systems
• Sufficient optimality conditions for convex semi-infinite programming
• Optimality conditions for convex semi-infinite programming problems
• Characterizations of optimality without constraint qualification for the abstract convex program
• Strong Duality for Semidefinite Programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Optimality criteria without constraint qualifications for linear semidefinite problems