An O( n L) iteration bound primal-dual cone affine scaling algorithm for linear programming
DOI10.1007/BF02592088zbMATH Open0853.90085OpenAlexW1498125507MaRDI QIDQ1919092FDOQ1919092
Authors: Jos F. Sturm, Shuzhong Zhang 
Publication date: 17 October 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592088
Recommendations
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A new variant of the primal affine scaling algorithm for linear programs
- scientific article; zbMATH DE number 1785846
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- scientific article; zbMATH DE number 1782596
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
primal-dual interior point algorithmprimal-dual central pathpolynomialityprimal-dual affine scaling method
Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Title not available (Why is that?)
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Interior path following primal-dual algorithms. I: Linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- The largest step path following algorithm for monotone linear complementarity problems
- An implementation of Karmarkar's algorithm for linear programming
- Conical projection algorithms for linear programming
- Title not available (Why is that?)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A survey of search directions in interior point methods for linear programming
- Title not available (Why is that?)
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Search directions for interior linear-programming methods
- Constant potential primal-dual algorithms: A framework
- A primal projective interior point method for linear programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A new variant of the primal affine scaling algorithm for linear programs
- New complexity results for the Iri-Imai method
Cited In (9)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard
- A circular cone relaxation primal interior point algorithm for LP
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- A new variant of the primal affine scaling algorithm for linear programs
- Approximate cone factorizations and lifts of polytopes
This page was built for publication: An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919092)
