Pivot versus interior point methods: Pros and cons
From MaRDI portal
Publication:1598748
DOI10.1016/S0377-2217(02)00061-9zbMath1005.90044OpenAlexW2040063808WikidataQ56080061 ScholiaQ56080061MaRDI QIDQ1598748
Publication date: 28 May 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00061-9
complexitylinear programmingsensitivity analysisinterior point methodssimplex algorithmspivot methods
Linear programming (90C05) Interior-point methods (90C51) Extreme-point and pivoting methods (90C49)
Related Items
A linear optimization oracle for zonotope computation, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, The basic solution ellipsoid method approach for the efficiency measurement problems, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity, A corrector-predictor interior-point method with new search direction for linear optimization, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, The big-M method with the numerical infinite \(M\), A new full-NT step interior-point method for circular cone optimization, Exterior point simplex-type algorithms for linear and network optimization problems, The double pivot simplex method, Interior Point Methods for Nonlinear Optimization, Dual–primal algorithm for linear optimization, On simplex method with most-obtuse-angle rule and cosine rule, An interesting characteristic of phase-1 of dual–primal algorithm for linear programming, Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods, A new least square algorithm for linear programming, New method for determining search directions for interior-point algorithms in linear optimization, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, Combined projected gradient algorithm for linear programming
Uses Software
Cites Work
- Approaches to sensitivity analysis in linear programming
- A new polynomial-time algorithm for linear programming
- Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
- On the finiteness of the criss-cross method
- A geometric view of parametric linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- Sensitivity analysis in linear programming: Just be careful!
- Pivot rules for linear programming: A survey on recent theoretical developments
- Criss-cross methods: A fresh view on pivot algorithms
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- New variants of finite criss-cross pivot algorithms for linear programming
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Lectures on Modern Convex Optimization
- A convergent criss-cross method
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
- On the Development of Optimization Theory
- New Finite Pivoting Rules for the Simplex Method
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Commentary—Progress in Linear Programming
- Implementing the simplex method for the Optimization Subroutine Library
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Technique for Resolving Degeneracy in Linear Programming
- Optimality and Degeneracy in Linear Programming
- An easy way to teach interior-point methods.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
