A primal-dual affine-scaling potential-reduction algorithm for linear programming
From MaRDI portal
Publication:1321668
DOI10.1007/BF01585163zbMath0803.90090MaRDI QIDQ1321668
Atsushi Nagasawa, Shinji Mizuno
Publication date: 28 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
complexitypotential functioninterior point algorithmprimal-dual affine-scaling potential-reduction algorithm
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (5)
Global convergence in infeasible-interior-point algorithms ⋮ Constant potential primal-dual algorithms: A framework ⋮ Potential-reduction methods in mathematical programming ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ A new class of polynomial primal-dual methods for linear and semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Quadratic Convergence in a Primal-Dual Method
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A Centered Projective Algorithm for Linear Programming
- A Low Complexity Interior-Point Algorithm for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
This page was built for publication: A primal-dual affine-scaling potential-reduction algorithm for linear programming
