Linear copositive programming: strong dual formulations and their properties

DOI10.23952/COT.2023.3MaRDI QIDQ7009060zbMATH OpenFDO

Authors O. I. Kostyukova, Tatiana V. Tchemisova

Publication date 20 March 2025

Published in Communications in Optimization Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/COT.2023.3

zbMATH Keywords

conic optimizationconstraint qualificationcopositive programmingstrong duality

Mathematics Subject Classification ID

Linear programming (90C05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
• A variational approach to copositive matrices
• An exact duality theory for semidefinite programming and its complexity implications
• An exact explicit dual for the linear copositive programming problem
• APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
• Copositive optimization -- recent developments and applications
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• scientific article; zbMATH DE number 3625109 (Why is no real title available?)
• scientific article; zbMATH DE number 1933860 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• Lexocographic multipliers
• On duality gap in linear conic problems
• On equating the difference between optimal and marginal values of general convex programs
• On equivalent representations and properties of faces of the cone of copositive matrices
• On strong duality in linear copositive programming
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Regularization algorithms for linear copositive problems
• Regularizing the abstract convex program
• Strong duality and minimal representations for cone optimization
• Strong Duality for Semidefinite Programming
• Strong duality for standard convex programs
• Strong duality in conic linear programming: facial reduction and extended duals

This page was built for publication: Linear copositive programming: strong dual formulations and their properties

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