On equivalent representations and properties of faces of the cone of copositive matrices
From MaRDI portal
(Redirected from Publication:5044098)
Abstract: The paper is devoted to a study of the cone of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a subset of the cone and use them to obtain different representations of faces of and the corresponding dual cones. We describe the minimal face of containing a given convex subset of this cone and prove some propositions that allow to obtain equivalent descriptions of the feasible sets of a copositive problems and may be useful for creating new numerical methods based on their regularization.
Recommendations
Cites work
- Algorithmic copositivity detection by simplicial partition
- An exact duality theory for semidefinite programming and its complexity implications
- Considering copositivity locally
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Convex Analysis
- Copositive optimization -- recent developments and applications
- Copositive programming via semi-infinite optimization
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Facial reduction algorithms for conic optimization problems
- Geometry of the copositive and completely positive cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 1186920 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- On the connection of facially exposed and nice cones
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Open problems in the theory of completely positive and copositive matrices
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- Strong duality and minimal representations for cone optimization
- Strong Duality for Semidefinite Programming
- The extreme rays of the \(5 \times 5\) copositive cone
- The extreme rays of the \(6\times 6\) copositive cone
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
Cited in
(16)- An exact explicit dual for the linear copositive programming problem
- A variational approach to copositive matrices
- Minimal zeros of copositive matrices
- Considering copositivity locally
- On the uniform duality in copositive optimization
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- Non-exposed polyhedral faces of the completely positive cone
- Strict complementarity and non-degeneracy of solutions to copositive programming problems
- Non-exposed faces of the cone of completely positive matrices
- Representation of zeros of a copositive matrix via maximal cliques of a graph
- Linear copositive programming: strong dual formulations and their properties
- Non-facial exposedness of copositive cones over symmetric cones
- Properties of the complementarity set for the cone of copositive matrices
- The singularity degree of a face of the cone of copositive matrices
- The maximal angle between 3 3 copositive matrices
- New applications of linear semi-infinite optimization theory in copositive optimization
This page was built for publication: On equivalent representations and properties of faces of the cone of copositive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044098)
