An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
type: Item
instance of: scholarly article
title: An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
zbMATH Open document ID: 0795.65036
DOI: 10.1016/0024-3795(93)90270-X
author: John A. Kaliski
author: Yinyu Ye
published in: Linear Algebra and its Applications
publication date: 1994-04-27T00:00:00Z
review text: The authors investigate linear complementarity problems with additional restrictions (priority goals), that some primal and dual variables must vanish. The potential reduction algorithm for linear programming and the corresponding unconstrained complementarity problem is generalized by modifying the potential function to get a polynomial time method. It is shown how the approach can be used to solve combined Phase I-II convex linear complementarity problems.
reviewed by: Klaus Schittkowski
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 539964
zbMATH Keywords: priority goals
zbMATH Keywords: liner complementarity problems
zbMATH Keywords: potential reduction algorithm
zbMATH Keywords: linear programming
zbMATH Keywords: unconstrained complementarity problem
zbMATH Keywords: polynomial time method
MaRDI profile type: Publication
cites work: A combined phase I-phase II projective algorithm for linear programming
cites work: Q3294638
cites work: A new polynomial-time algorithm for linear programming
cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems
cites work: An interior point potential reduction algorithm for the linear complementarity problem
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: On Anstreicher's combined phase I-phase II projective algorithm for linear programming
cites work: A Centered Projective Algorithm for Linear Programming
cites work: Comparative analysis of affine scaling algorithms based on simplifying assumptions
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
description: scientific article; zbMATH DE number 539964