Strict complementarity and non-degeneracy of solutions to copositive programming problems

DOI10.1080/03155986.2025.2535919MaRDI QIDQ6854579zbMATH OpenFDO

Authors O. I. Kostyukova

Publication date 24 February 2026

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2025.2535919

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Cites work

• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• A guide to conic optimisation and its applications
• A new certificate for copositivity
• A note on strict complementarity for the doubly non-negative cone
• A strict complementarity approach to error bound and sensitivity of solution of conic programs
• Algorithm Theory - SWAT 2004
• Complementarity and nondegeneracy in semidefinite programming
• Copositive optimization -- recent developments and applications
• Faces of the 5 5 completely positive cone
• Geometry of the copositive and completely positive cones
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Irreducible elements of the copositive cone
• Minimal zeros of copositive matrices
• Non-exposed polyhedral faces of the completely positive cone
• On equivalent representations and properties of faces of the cone of copositive matrices
• On the generic properties of convex optimization problems in conic form
• On the identification of the optimal partition for semidefinite optimization
• On the number of CP factorizations of a completely positive matrix
• On the stable solution of large scale problems over the doubly nonnegative cone
• Open problems in the theory of completely positive and copositive matrices
• Parametric semidefinite programming: geometry of the trajectory of solutions
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Representation of zeros of a copositive matrix via maximal cliques of a graph
• Sensitivity Analysis In Linear And Convex Quadratic Optimization: Invariant Active Constraint Set And Invariant Set Intervals^*
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization

This page was built for publication: Strict complementarity and non-degeneracy of solutions to copositive programming problems

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