scientific article; zbMATH DE number 4119923

zbMath0683.90044MaRDI QIDQ4733658

Michael J. Todd

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyellipsoid algorithmsimplex methodinterior algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (17)

Interior-point algorithms for semi-infinite programming ⋮ On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds ⋮ Scaling, shifting and weighting in interior-point methods ⋮ A lower bound on the number of iterations of long-step primal-dual linear programming algorithms ⋮ Generic Primal-dual Interior Point Methods Based on a New Kernel Function ⋮ A unified approach to interior point algorithms for linear complementarity problems: A summary ⋮ A survey of search directions in interior point methods for linear programming ⋮ Integrability of vector and multivector fields associated with interior point methods for linear programming ⋮ On the complexity of following the central path of linear programs by linear extrapolation. II ⋮ An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem ⋮ On interior algorithms for linear programming with no regularity assumptions ⋮ Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals ⋮ A new polynomial time method for a linear complementarity problem ⋮ An interior-point algorithm for linear optimization based on a new barrier function ⋮ A polynomial-time algorithm for linear optimization based on a new class of kernel functions ⋮ On the choice of parameters for power-series interior point algorithms in linear programming ⋮ The affine-scaling direction for linear programming is a limit of projective-scaling directions

This page was built for publication: