On the expected condition number of linear programming problems

DOI10.1007/S00211-002-0385-1zbMath1030.65039DBLPjournals/nm/CuckerW03OpenAlexW2049154861WikidataQ57733248 ScholiaQ57733248MaRDI QIDQ1402168

Mario Wschebor, Felipe Cucker

Publication date: 19 August 2003

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-002-0385-1

zbMATH Keywords

linear programmingcondition number

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (11)

Smoothed analysis of complex conic condition numbers ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ Computational complexity of kernel-based density-ratio estimation: a condition number analysis ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ Robust smoothed analysis of a condition number for linear programming ⋮ A general expression for the distribution of the maximum of a Gaussian field and the approximation of the tail ⋮ Coverage processes on spheres and condition numbers for linear programming ⋮ On the distribution of the maximum of a Gaussian field with \(d\) parameters ⋮ On the expected number of zeros of a random harmonic polynomial ⋮ Conditioning of random conic systems under a general family of input distributions ⋮ Sign consistent linear programming problems

Uses Software

• mctoolbox

This page was built for publication: On the expected condition number of linear programming problems