An O( n L) iteration bound primal-dual cone affine scaling algorithm for linear programming
From MaRDI portal
Publication:1919092
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
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A new polynomial-time algorithm for linear programming
- A new variant of the primal affine scaling algorithm for linear programs
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A primal projective interior point method for linear programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A survey of search directions in interior point methods for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Conical projection algorithms for linear programming
- Constant potential primal-dual algorithms: A framework
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Interior path following primal-dual algorithms. I: Linear programming
- New complexity results for the Iri-Imai method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Search directions for interior linear-programming methods
- The largest step path following algorithm for monotone linear complementarity problems
Cited in
(9)- Approximate cone factorizations and lifts of polytopes
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A circular cone relaxation primal interior point algorithm for LP
- A new variant of the primal affine scaling algorithm for linear programs
- 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 Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
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)
