The minimal cone for conic linear programming
From MaRDI portal
Publication:766252
Recommendations
- The orthogonal complement of faces for cones associated with the cone of positive semidefinite matrices
- Strong duality and minimal representations for cone optimization
- Strong duality in conic linear programming: facial reduction and extended duals
- A note on the minimal cone for conic linear programming
- Duality formulations in semidefinite programming
Cites work
- scientific article; zbMATH DE number 3728055 (Why is no real title available?)
- scientific article; zbMATH DE number 3737415 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- An exact duality theory for semidefinite programming and its complexity implications
- Convex Analysis
- On the Closedness of the Linear Image of a Closed Convex Cone
- Perfect duality in semi-infinite and semidefinite programming
- Regularizing the abstract convex program
- Some applications of optimization in matrix theory
- Strong Duality for Semidefinite Programming
- Understanding linear semi-infinite programming via linear programming over cones
Cited in
(5)- The orthogonal complement of faces for cones associated with the cone of positive semidefinite matrices
- Strong duality in conic linear programming: facial reduction and extended duals
- A note on the minimal cone for conic linear programming
- Strong duality and minimal representations for cone optimization
- The minimax direction for the direct product of a convex cone with its application to testing problems
This page was built for publication: The minimal cone for conic linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766252)
