Near boundary behavior of primal-dual potential reduction algorithms for linear programming
From MaRDI portal
Publication:1803608
DOI10.1007/BF01581269zbMATH Open0780.90066MaRDI QIDQ1803608FDOQ1803608
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4197744
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- scientific article; zbMATH DE number 1047677
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Title not available (Why is that?)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Title not available (Why is that?)
- A polynomial-time algorithm for a class of linear complementarity problems
- 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
- 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 Centered Projective Algorithm for Linear Programming
- An interior point potential reduction algorithm for the linear complementarity problem
- Title not available (Why is that?)
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- Title not available (Why is that?)
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
Cited In (10)
- On the finite convergence of interior-point algorithms for linear programming
- Convergence behavior of interior-point algorithms
- A boundary-point LP solution method and its application to dense linear programs
- On the length of primal-dual projection of potential reduction algorithm
- On lower bound updates in primal potential reduction methods for linear programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Potential-reduction methods in mathematical programming
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
- Asymptotic Behavior of Continuous Trajectories for Primal-Dual Potential-Reduction Methods
This page was built for publication: Near boundary behavior of primal-dual potential reduction algorithms for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803608)
