Abstract: Amenability is a geometric property of convex cones that is stronger than facial exposedness and assists in the study of error bounds for conic feasibility problems. In this paper we establish numerous properties of amenable cones, and investigate the relationships between amenability and other properties of convex cones, such as niceness and projectional exposure. We show that the amenability of a compact slice of a closed convex cone is equivalent to the amenability of the cone, and prove several results on the preservation of amenability under intersections and other convex operations. It then follows that homogeneous, doubly nonnegative and other cones that can be represented as slices of the cone of positive semidefinite matrices, are amenable. It is known that projectionally exposed cones are amenable and that amenable cones are nice, however the converse statements have been open questions. We construct an example of a four-dimensional cone that is nice but not amenable. We also show that amenable cones are projectionally exposed in dimensions up to and including four. We conclude with a discussion on open problems related to facial structure of convex sets that we came across in the course of this work, but were not able to fully resolve.
Recommendations
Cites work
- A study of projectionally exposed cones
- Amenable cones: error bounds without constraint qualifications
- Completely positive cones: are they facially exposed?
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Error Bounds for Linear Matrix Inequalities
- Error bounds in mathematical programming
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Exposing Constraints
- Facially dual complete (nice) cones and lexicographic tangents
- Facially exposed cones are not always nice
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3529038 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- Invariance and efficiency of convex representations
- Lifts of Convex Sets and Cone Factorizations
- On extreme points of convex sets
- On local coincidence of a convex set and its tangent cone
- On Nesterov's approach to semi-infinite programming
- On the Closedness of the Linear Image of a Closed Convex Cone
- On the connection of facially exposed and nice cones
- On the duality operator of a convex cone
- Projectionally Exposed Cones
- Projectionally exposed cones in \(R^ 3\)
- Regularizing the abstract convex program
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong duality in conic linear programming: facial reduction and extended duals
- Theory of cones
- Variational analysis of regular mappings. Theory and applications
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
Cited in
(6)- Amenable cones: error bounds without constraint qualifications
- Error bounds, facial residual functions and applications to the exponential cone
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Hyperbolicity cones are amenable
- Tight error bounds for log-determinant cones without constraint qualifications
- Non-facial exposedness of copositive cones over symmetric cones
This page was built for publication: Amenable cones are particularly nice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869817)
