Probabilistic analysis of the Grassmann condition number

DOI10.1007/S10208-013-9178-4zbMath1309.90075arXiv1112.2603OpenAlexW2015837655MaRDI QIDQ2340501

Peter Bürgisser, Dennis Amelunxen

Publication date: 20 April 2015

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

perturbationcondition numberconvex programmingGrassmann manifoldtube formulasaverage analysisspherically convex sets

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Semidefinite programming (90C22) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Spherical and hyperbolic convexity (52A55) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (9)

Average-case complexity without the black swans ⋮ Conic intrinsic volumes of Weyl chambers ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Some preconditioners for systems of linear inequalities ⋮ $p$-Adic Integral Geometry ⋮ On the volume of tubular neighborhoods of real algebraic varieties ⋮ On the number of flats tangent to convex hypersurfaces in random position ⋮ Intrinsic volumes of symmetric cones and applications in convex programming ⋮ From Steiner formulas for cones to concentration of intrinsic volumes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal-dual symmetric relaxation for homogeneous conic systems
• A geometric analysis of Renegar's condition number, and its interplay with conic curvature
• Some perturbation theory for linear programming
• On the complexity of linear programming under finite precision arithmetic
• A characterization of the distance to infeasibility under block-structured perturbations
• Computing approximate solutions for convex conic systems of constraints
• Linear programming, complexity theory and elementary functional analysis
• Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
• Intrinsic volumes of symmetric cones and applications in convex programming
• A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
• A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
• Condition
• Stochastic and Integral Geometry
• The probability that a slightly perturbed numerical analysis problem is difficult
• The Probability That a Numerical Analysis Problem is Difficult
• The kinematic formula in Riemannian homogeneous spaces
• On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
• A Coordinate-Free Condition Number for Convex Programming
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• Condition Numbers of Gaussian Random Matrices
• On an Extension of Condition Number Theory to Nonconic Convex Optimization
• On the Volume of Tubes
• A new condition number for linear programming

This page was built for publication: Probabilistic analysis of the Grassmann condition number