A note on a potential reduction algorithm for LP with simultaneous primal-dual updating

DOI10.1016/0167-6377(91)90068-ZzbMath0744.90053MaRDI QIDQ1186945

S. Singh

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

linear complementarity; Potential function reduction algorithms; primal- dual update algorithm

Mathematics Subject Classification ID

90C05: Linear programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

A note on a potential reduction algorithm for LP with simultaneous primal-dual updating, Near boundary behavior of primal-dual potential reduction algorithms for linear programming

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Interior path following primal-dual algorithms. I: 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 note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• 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
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming