An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
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.
scientific article; zbMATH DE number 539964