A unified approach to interior point algorithms for linear complementarity problems: A summary
References (27)
- et al.
Sufficient matrices and the linear complementarity problem
Linear Algebra Appl.
(1989) A variation on Karmarkar's algorithm for solving linear programming problems
Math. Programming
(1986)- et al.
A polynomial time version of the affine algorithm
A note on the complexity of the LCP: The LCP is strongly NP-complete
Iterative solution of problems of linear and quadratic programming
Soviet Math. Dokl.
(1967)- et al.
A polynomial-time predictor-corrector algorithm for linear complementarity problems
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
A new polynomial-time algorithm for linear programming
Combinatorica
(1984)- M. Kojima, N. Megiddo and T. Noma, “Homotopy continuation methods for nonlinear complementarity problems”, Math. Oper....
- et al.
A unified approach to interior point algorithms for linear complementarity problems
A primal-dual interior point algorithm for linear programming
A polynomial-time algorithm for a class of linear complementary problems
Math. Programming
(1989)
Cited by (21)
A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
1994, Computers and Operations ResearchFast Contact-Implicit Model Predictive Control
2024, IEEE Transactions on RoboticsA Relaxation Approach to Feature Selection for Linear Mixed Effects Models
2024, Journal of Computational and Graphical Statistics
Copyright © 1991 Published by Elsevier B.V.