A bound on the Carathéodory number
From MaRDI portal
Publication:2401297
DOI10.1016/j.laa.2017.06.043zbMath1373.52008arXiv1608.07170OpenAlexW2512467472MaRDI QIDQ2401297
Publication date: 8 September 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07170
Positive matrices and their generalizations; cones of matrices (15B48) Finite-dimensional structures of Jordan algebras (17C55) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (4)
Facial Reduction and Partial Polyhedrality ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Limitations on the Expressive Power of Convex Cones without Long Chains of Faces ⋮ Solving SDP completely with an interior point oracle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Geometry of the copositive and completely positive cones
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Vector spaces as unions of proper subspaces
- Theory of cones
- Regularizing the abstract convex program
- Characterization of the barrier parameter of homogeneous convex cones
- A derivative-coderivative inclusion in second-order nonsmooth analysis
- Similarity and other spectral relations for symmetric cones
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- Nonnegative polynomials and their Carathéodory number
- The lattice of faces of a finite dimensional cone
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
- Open problems in the theory of completely positive and copositive matrices
- Several Jordan-algebraic aspects of optimization†
- ``Efficient” Subgradient Methods for General Convex Optimization
- On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
This page was built for publication: A bound on the Carathéodory number
