The simplex method. A probabilistic analysis
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05)
Recommendations
- scientific article; zbMATH DE number 4197740
- scientific article; zbMATH DE number 3898607
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- How fast does the simplex method usually work? Or: the search for (stochastic) independence
- New results on the average behavior of simplex algorithms
Cited in
(62)- Linear programming with spheres and hemispheres of objective vectors
- Pivot rules for linear programming: A survey on recent theoretical developments
- A strictly improving linear programming Phase I algorithm
- A finite algorithm for solving general quadratic problems
- Linear programming, the simplex algorithm and simple polytopes
- Criss-cross methods: A fresh view on pivot algorithms
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming
- Credal ensembles of classifiers
- Series associated to some expressions involving the volume of the unit ball and applications
- Estimating support functions of random polytopes via Orlicz norms
- Monotonicity properties of the volume of the unit ball in \({\mathbb{R}^{n}}\)
- Frontiers of sphere recognition in practice
- New bounds and asymptotic expansions for the volume of the unit ball in \(\mathbb{R}^n\) based on Padé approximation
- Schwarz-Pick lemma for harmonic and hyperbolic harmonic functions
- A linear programming primer: from Fourier to Karmarkar
- How fast does the simplex method usually work? Or: the search for (stochastic) independence
- Iterative computation of security strategies of matrix games with growing action set
- Moser's shadow problem
- Optimizing MSE for clustering with balanced size constraints
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Inequalities for the volume of the unit ball in \(\mathbb R^n\)
- Convex geometry and its applications. Abstracts from the workshop held December 12--18, 2021 (hybrid meeting)
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- New results on the average behavior of simplex algorithms
- scientific article; zbMATH DE number 3880432 (Why is no real title available?)
- Volume of unit ball in an n-dimensional normed space and its asymptotic properties
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- scientific article; zbMATH DE number 3898607 (Why is no real title available?)
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- A path-following method for finding multiple equilibrium points in cellular neural networks
- Sharp inequalities for the digamma and polygamma functions
- A counterexample to the Hirsch conjecture
- Universality for Eigenvalue Algorithms on Sample Covariance Matrices
- Some properties of the gamma and psi functions, with applications
- scientific article; zbMATH DE number 764392 (Why is no real title available?)
- On the variance of the number of pivot steps required by the simplex algorithm
- scientific article; zbMATH DE number 803180 (Why is no real title available?)
- The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
- A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
- The Ahlfors-Schwarz lemma, curvature, distance and distortion
- scientific article; zbMATH DE number 4197740 (Why is no real title available?)
- Random projections for linear programming
- Book Review: The basic George B. Dantzig
- A generalized simplex method for integer problems given by verification oracles
- Sharp inequalities related to the volume of the unit ball in \(\mathbb{R}^n\)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- Monotone paths on cross-polytopes
- A spectral Bernstein theorem
- The average computing time of the simplex method in a generalized rotational symmetry model
- Linear optimization with the shadow vertex algorithm in the context of probabilistic analyses. Studies on the transition from phase 1 to phase 2 in the average-case analysis and in the smoothing analysis of the simplex method
- Upper and lower bounds on the smoothed complexity of the simplex method
- Hyperelliptic integrals and special functions for the spatial variational problem
- A spectral approach to polytope diameter
- Inequalities and asymptotic expansions related to the volume of the unit ball in \(\mathbb{R}^n\)
- Upper and lower bounds on the smoothed complexity of the simplex method
- On the number of degenerate simplex pivots
- On the number of degenerate simplex pivots
- On the shadow simplex method for curved polyhedra
- Asymptotic bounds on the combinatorial diameter of random polytopes
- Pivot polytopes of products of simplices and shuffles of associahedra
- S-hypersimplices, pulling triangulations, and monotone paths
- Simplex-inspired algorithms for solving a class of convex programming problems
This page was built for publication: The simplex method. A probabilistic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083366)
