An extension of the potential reduction algorithm for linear complementarity problems with some priority goals

DOI10.1016/0024-3795(93)90270-XzbMath0795.65036MaRDI QIDQ1318200

John A. Kaliski, Yinyu Ye

Publication date: 27 April 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

linear programmingpotential reduction algorithmpolynomial time methodliner complementarity problemspriority goalsunconstrained complementarity problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

On the equivalence of linear complementarity problems

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Comparative analysis of affine scaling algorithms based on simplifying assumptions
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming
• An interior point potential reduction algorithm for the linear complementarity problem
• A Centered Projective Algorithm for Linear Programming
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming