An asymptotic estimate of the average number of steps of the parametric simplex method
From MaRDI portal
DOI10.1016/0041-5553(86)90123-0zbMATH Open0621.90046OpenAlexW2055332394MaRDI QIDQ3758557FDOQ3758557
P. V. Sporyshev, A. 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
Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)
Cited In (12)
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks
- Sharp recovery bounds for convex demixing, with applications
- Projection method for solving systems of linear inequalities
- Random projections of regular simplices
- Expected volumes of Gaussian polytopes, external angles, and multiple order statistics
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- From Steiner formulas for cones to concentration of intrinsic volumes
- Compressed sensing of data with a known distribution
- Title not available (Why is that?)
- Absorption probabilities for Gaussian polytopes and regular spherical simplices
- Expected number of steps of a random optimization method. Reply
This page was built for publication: An asymptotic estimate of the average number of steps of the parametric simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758557)
