An exact explicit dual for the linear copositive programming problem

DOI10.1007/S11590-022-01870-0MaRDI QIDQ2679002zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

constraint qualificationsextended dual problemlinear copositive programmingnormalized immobile index setstrong duality

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• On strong duality in linear copositive programming
• Optimality conditions for linear copositive programming problems with isolated immobile indices
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• Copositive programming via semi-infinite optimization
• Regularization algorithms for linear copositive problems

Cites work

• A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
• An exact duality theory for semidefinite programming and its complexity implications
• APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
• Copositive optimization -- recent developments and applications
• Copositive programming via semi-infinite optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• Interior Point Methods for Nonlinear Optimization
• On duality gap in linear conic problems
• On equivalent representations and properties of faces of the cone of copositive matrices
• On strong duality in linear copositive programming
• On the irreducibility, self-duality an non-homogeneity of completely positive cones
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Optimality criteria without constraint qualifications for linear semidefinite problems
• Regularizing the abstract convex program
• Strong duality and minimal representations for cone optimization
• Strong Duality for Semidefinite Programming

Cited in

(5)

• On strong duality in linear copositive programming
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• Optimality conditions for linear copositive programming problems with isolated immobile indices
• On the uniform duality in copositive optimization
• Linear copositive programming: strong dual formulations and their properties

This page was built for publication: An exact explicit dual for the linear copositive programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679002)