On the uniform duality in copositive optimization

Cites Work

Title not available (Why is that?)
Copositive optimization -- recent developments and applications
Geometry of the copositive and completely positive cones
Uniform LP duality for semidefinite and semi-infinite programming
Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
Partially finite convex programming. I: Quasi relative interiors and duality theory
Completely positive cones: are they facially exposed?
On the connection of facially exposed and nice cones
Constraint qualifications characterizing Lagrangian duality in convex optimization
On strong duality in linear copositive programming
Immobile indices and CQ-free optimality criteria for linear copositive programming problems
Bad Semidefinite Programs: They All Look the Same
Uniform duality in semi-infinite convex optimization
Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
Characterizations of optimality without constraint qualification for the abstract convex program
Strong Duality for Semidefinite Programming
Duality for semi-definite and semi-infinite programming
On equivalent representations and properties of faces of the cone of copositive matrices
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
On the Closedness of the Linear Image of a Closed Convex Cone
APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
Algorithm 457: finding all cliques of an undirected graph
Considering copositivity locally
Understanding badly and well-behaved linear matrix inequalities via semi-infinite optimization

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)