scientific article; zbMATH DE number 4119923
From MaRDI portal
zbMATH Open0683.90044MaRDI QIDQ4733658FDOQ4733658
Authors: Michael J. Todd 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (26)
- Interior-point algorithms for semi-infinite programming
- Commentary—Progress in Linear Programming
- Scaling, shifting and weighting in interior-point methods
- Integrability of vector and multivector fields associated with interior point methods for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Title not available (Why is that?)
- Some recent advances and new directions in interior point methods for linear programming
- On the development of simplex methods for linear multiplier-alike method
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Advances in linear and nonlinear programming
- A new polynomial time method for a linear complementarity problem
- Title not available (Why is that?)
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- An interior-point algorithm for linear optimization based on a new barrier function
- On the choice of parameters for power-series interior point algorithms in linear programming
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- On interior algorithms for linear programming with no regularity assumptions
- A survey of search directions in interior point methods for linear programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- Title not available (Why is that?)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- The affine-scaling direction for linear programming is a limit of projective-scaling directions
- Recent advances in the decomposition approach to linear programming
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- Some recent advances and new directions in linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733658)
