Computing the radius of pointedness of a convex cone
From MaRDI portal
Publication:2467159
DOI10.1007/S10107-006-0069-1zbMATH Open1219.52001OpenAlexW2013204127MaRDI QIDQ2467159FDOQ2467159
Publication date: 21 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0069-1
Convex programming (90C25) Interior-point methods (90C51) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational Analysis
- Computing approximate solutions for convex conic systems of constraints
- On pairs of vectors achieving the maximal angle of a convex cone
- Axiomatization of the index of pointedness for closed convex cones
- Measuring the degree of pointedness of a closed convex cone: a metric approach
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
Cited In (6)
- Antipodality in convex cones and distance to unpointedness
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
- Normality and modulability indices. I: Convex cones in normed spaces
- Normality and modulability indices. II: Convex cones in Hilbert spaces
- On pairs of vectors achieving the maximal angle of a convex cone
- Solidity indices for convex cones
Recommendations
- Measuring the degree of pointedness of a closed convex cone: a metric approach 👍 👎
- On pairs of vectors achieving the maximal angle of a convex cone 👍 👎
- Antipodality in convex cones and distance to unpointedness 👍 👎
- Axiomatization of the index of pointedness for closed convex cones 👍 👎
- Inradius and circumradius of various convex cones arising in applications 👍 👎
This page was built for publication: Computing the radius of pointedness of a convex cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467159)
