On the uniform duality in copositive optimization

DOI10.1007/S10957-024-02515-1MaRDI QIDQ6644265zbMATH OpenFDO

Authors O. I. Kostyukova, Tatiana V. Tchemisova, Olga Dudina

Publication date 27 November 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-024-02515-1

zbMATH Keywords

copositive programmingduality gapimmobile indicesuniform LP duality

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25) 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
• scientific article; zbMATH DE number 7743708
• An exact explicit dual for the linear copositive programming problem

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
• Bad semidefinite programs: they all look the same
• Characterizations of optimality without constraint qualification for the abstract convex program
• Characterizing bad semidefinite programs: normal forms and short proofs
• Completely positive cones: are they facially exposed?
• Considering copositivity locally
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
• Copositive optimization -- recent developments and applications
• Duality for semi-definite and semi-infinite programming
• Geometry of the copositive and completely positive cones
• scientific article; zbMATH DE number 3818523 (Why is no real title available?)
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• On equivalent representations and properties of faces of the cone of copositive matrices
• On strong duality in linear copositive programming
• On the Closedness of the Linear Image of a Closed Convex Cone
• On the connection of facially exposed and nice cones
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Strong Duality for Semidefinite Programming
• Understanding badly and well-behaved linear matrix inequalities via semi-infinite optimization
• Uniform duality in semi-infinite convex optimization
• Uniform LP duality for semidefinite and semi-infinite programming

Cited in

(2)

• Non-exposed faces of the cone of completely positive matrices
• Properties of the complementarity set for the cone of copositive matrices

This page was built for publication: On the uniform duality in copositive optimization

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