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