Amenable Cones Are Particularly Nice
From MaRDI portal
Publication:5869817
DOI10.1137/20M138466XzbMath1501.90068arXiv2011.07745OpenAlexW3101080484MaRDI QIDQ5869817
Bruno F. Lourenço, Vera Roshchina, James Saunderson
Publication date: 29 September 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07745
Related Items (3)
Error bounds, facial residual functions and applications to the exponential cone ⋮ Self-Dual Polyhedral Cones and Their Slack Matrices ⋮ Hyperbolicity cones are amenable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of projectionally exposed cones
- On the duality operator of a convex cone
- Projectionally exposed cones in \(R^ 3\)
- Theory of cones
- Regularizing the abstract convex program
- Error bounds in mathematical programming
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Completely positive cones: are they facially exposed?
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On Nesterov's approach to semi-infinite programming
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- On the connection of facially exposed and nice cones
- Amenable cones: error bounds without constraint qualifications
- On local coincidence of a convex set and its tangent cone
- On extreme points of convex sets
- Invariance and efficiency of convex representations
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Exposing Constraints
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Error Bounds for Linear Matrix Inequalities
- Projectionally Exposed Cones
- Variational Analysis of Regular Mappings
- Facially Exposed Cones Are Not Always Nice
- Lifts of Convex Sets and Cone Factorizations
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents
- On the Closedness of the Linear Image of a Closed Convex Cone
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Amenable Cones Are Particularly Nice
