Parametric conic optimization problems over semidefinite plus nonnegative cone
From MaRDI portal
Cites work
- A guide to conic optimisation and its applications
- A note on strict complementarity for the doubly non-negative cone
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Complementarity and nondegeneracy in semidefinite programming
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- scientific article; zbMATH DE number 1534294 (Why is no real title available?)
- Introduction to semidefinite, conic and polynomial optimization
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- On equivalent representations and properties of faces of the cone of copositive matrices
- On sensitivity of central solutions in semidefinite programming
- On the connection of facially exposed and nice cones
- 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 analysis of semidefinite optimization
- Perturbation analysis of second-order cone programming problems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Stable sets and polynomials
This page was built for publication: Parametric conic optimization problems over semidefinite plus nonnegative cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656648)