A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (19)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Bimatrix Equilibrium Points and Mathematical Programming
1965 • 1,020 citations
Linear complementarity, linear and nonlinear programming
1989 • 1,010 citations
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
1991 • 533 citations
Constrained Global Optimization: Algorithms and Applications
1987 • 518 citations
An O(n 3 L) potential reduction algorithm for linear programming
1991 • 295 citations
An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
1991 • 174 citations
A Centered Projective Algorithm for Linear Programming
1990 • 153 citations
Sufficient matrices and the linear complementarity problem
1989 • 137 citations
On the finite convergence of interior-point algorithms for linear programming
1992 • 83 citations
An interior point potential reduction algorithm for the linear complementarity problem
1992 • 76 citations
A class of linear complementarity problems solvable in polynomial time
1991 • 68 citations
Polynomial affine algorithms for linear programming
1990 • 58 citations
Computing stationary points
1978 • 52 citations
Improving the convergence of fixed-point algorithms
1978 • 49 citations
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
1982 • 44 citations
A Simplicial Algorithm for Stationary Point Problems on Polytopes
1989 • 35 citations
Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
1993 • 25 citations
Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
1991 • 13 citations