An exact explicit dual for the linear copositive programming problem
From MaRDI portal
Publication:2679002
DOI10.1007/s11590-022-01870-0OpenAlexW4221069180MaRDI QIDQ2679002
O. I. Kostyukova, Tatiana V. Tchemisova
Publication date: 18 January 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01870-0
strong dualityconstraint qualificationsextended dual problemlinear copositive programmingnormalized immobile index set
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Optimality criteria without constraint qualifications for linear semidefinite problems
- On duality gap in linear conic problems
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Strong duality and minimal representations for cone optimization
- On strong duality in linear copositive programming
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Copositive programming via semi-infinite optimization
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Interior Point Methods for Nonlinear Optimization
- Strong Duality for Semidefinite Programming
- On equivalent representations and properties of faces of the cone of copositive matrices
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- On the irreducibility, self-duality an non-homogeneity of completely positive cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: An exact explicit dual for the linear copositive programming problem