A Coordinate-Free Condition Number for Convex Programming

DOI10.1137/110835177zbMath1266.90139arXiv1105.4049OpenAlexW2078263475MaRDI QIDQ4899023

Dennis Amelunxen, Peter Bürgisser

Publication date: 4 January 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.4049

zbMATH Keywords

perturbationcondition numberconvex programming

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Related Items (10)

A geometrical stability condition for compressed sensing ⋮ Condition of Intersecting a Projective Variety with a Varying Linear Subspace ⋮ On condition number theorems in mathematical programming ⋮ The Condition Number of Join Decompositions ⋮ Some preconditioners for systems of linear inequalities ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ From Steiner formulas for cones to concentration of intrinsic volumes ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Probabilistic analysis of the Grassmann condition number

This page was built for publication: A Coordinate-Free Condition Number for Convex Programming