An asymptotic estimate of the average number of steps of the parametric simplex method

DOI10.1016/0041-5553(86)90123-0zbMath0621.90046OpenAlexW2055332394MaRDI QIDQ3758557

P. V. Sporyshev, Anatoly M. Vershik

Publication date: 1986

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(86)90123-0

zbMATH Keywords

asymptotic estimatesimplex methodaverage number of stepsparametric version

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (9)

Projection method for solving systems of linear inequalities ⋮ Compressed sensing of data with a known distribution ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Unnamed Item ⋮ Random projections of regular simplices ⋮ From Steiner formulas for cones to concentration of intrinsic volumes ⋮ Expected volumes of Gaussian polytopes, external angles, and multiple order statistics ⋮ Absorption probabilities for Gaussian polytopes and regular spherical simplices ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks

This page was built for publication: An asymptotic estimate of the average number of steps of the parametric simplex method