An asymptotic estimate of the average number of steps of the parametric simplex method
From MaRDI portal
Publication:3758557
Recommendations
- scientific article; zbMATH DE number 3845338
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- scientific article; zbMATH DE number 3880432
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- scientific article; zbMATH DE number 3898607
Cited in
(13)- Random cones in high dimensions. I: Donoho-Tanner and Cover-Efron cones.
- Expected volumes of Gaussian polytopes, external angles, and multiple order statistics
- Random projections of regular simplices
- Sharp recovery bounds for convex demixing, with applications
- scientific article; zbMATH DE number 3845338 (Why is no real title available?)
- Expected number of steps of a random optimization method. Reply
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Projection method for solving systems of linear inequalities
- From Steiner formulas for cones to concentration of intrinsic volumes
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks
- Absorption probabilities for Gaussian polytopes and regular spherical simplices
- Compressed sensing of data with a known distribution
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)
