A path-following version of the Todd-Burrell procedure for linear programming
From MaRDI portal
Recommendations
- Path-Following Methods for Linear Programming
- New trajectory-following polynomial-time algorithm for linear programming problems
- scientific article; zbMATH DE number 108317
- Todd's low-complexity algorithm is a predictor-corrector path-following method
- On the generalized path-following methods for linear programming
Cites work
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A Path-Following Projective Interior Point Method for Linear Programming
- A polynomial Newton method for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A survey of search directions in interior point methods for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
Cited in
(5)- Volumetric path following algorithms for linear programming
- Path-Following Methods for Linear Programming
- scientific article; zbMATH DE number 503304 (Why is no real title available?)
- scientific article; zbMATH DE number 1047676 (Why is no real title available?)
- scientific article; zbMATH DE number 3892507 (Why is no real title available?)
This page was built for publication: A path-following version of the Todd-Burrell procedure for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374685)
