scientific article; zbMATH DE number 554743
From MaRDI portal
Publication:4288560
zbMATH Open0815.65081MaRDI QIDQ4288560FDOQ4288560
Authors: Michael J. Todd 
Publication date: 30 June 1995
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2154409
- A Low Complexity Interior-Point Algorithm for Linear Programming
- On the finite convergence of interior-point algorithms for linear programming
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming
- scientific article; zbMATH DE number 409894
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- scientific article; zbMATH DE number 123966
- Boundary Behavior of Interior Point Algorithms in Linear Programming
linear programminginterior point methodslower bounds on the number of iterationsprimal-dual affine scaling algorithm
Cited In (6)
- Title not available (Why is that?)
- Smoothed analysis of condition numbers and complexity implications for linear programming
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
- Strict monotonicity in Todd's low-complexity algorithm for linear programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- Average number of iterations of some polynomial interior-point -- algorithms for 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 Q4288560)
