On equivalent representations and properties of faces of the cone of copositive matrices
DOI10.1080/02331934.2022.2027939zbMath1500.15029arXiv2012.03610OpenAlexW4210658870MaRDI QIDQ5044098
Tatiana V. Tchemisova, O. I. Kostyukova
Publication date: 24 October 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.03610
regularizationcopositive programmingSlater conditionface reductionzero vectors of a subset of copositive matrices
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Facial reduction algorithms for conic optimization problems
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- The extreme rays of the \(5 \times 5\) copositive cone
- Geometry of the copositive and completely positive cones
- Handbook on semidefinite, conic and polynomial optimization
- Semi-infinite programming
- Semi-infinite optimization: Structure and stability of the feasible set
- An exact duality theory for semidefinite programming and its complexity implications
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Strong duality and minimal representations for cone optimization
- On the connection of facially exposed and nice cones
- The extreme rays of the \(6\times 6\) copositive cone
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Copositive programming via semi-infinite optimization
- Algorithmic copositivity detection by simplicial partition
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Open problems in the theory of completely positive and copositive matrices
- Strong Duality for Semidefinite Programming
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- Convex Analysis
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Considering copositivity locally
This page was built for publication: On equivalent representations and properties of faces of the cone of copositive matrices
