Computing the radius of pointedness of a convex cone

DOI10.1007/s10107-006-0069-1zbMath1219.52001OpenAlexW2013204127MaRDI QIDQ2467159

Alberto Seeger, Alfredo Noel Iusem

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

zbMATH Keywords

convex coneconvex programming with conic constraintsdegree of pointedness

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)

Related Items

Solidity indices for convex cones ⋮ Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization ⋮ Antipodality in convex cones and distance to unpointedness ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Axiomatization of the index of pointedness for closed convex cones
• Computing approximate solutions for convex conic systems of constraints
• On pairs of vectors achieving the maximal angle of a convex cone
• Variational Analysis
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Measuring the degree of pointedness of a closed convex cone: a metric approach