Near boundary behavior of primal-dual potential reduction algorithms for linear programming
From MaRDI portal
Publication:1803608
DOI10.1007/BF01581269zbMath0780.90066MaRDI QIDQ1803608
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (6)
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Potential-reduction methods in mathematical programming ⋮ On the finite convergence of interior-point algorithms for linear programming ⋮ Convergence behavior of interior-point algorithms ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ A primal-dual affine-scaling potential-reduction algorithm for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear 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
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- An interior point potential reduction algorithm for the linear complementarity problem
- 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
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
This page was built for publication: Near boundary behavior of primal-dual potential reduction algorithms for linear programming
