Large-Step Interior Point Algorithms for Linear Complementarity Problems
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (2), 398-412
- https://doi.org/10.1137/0803018
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A little theorem of the bigℳ in interior point algorithmsMathematical Programming, 1993
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsLecture Notes in Computer Science, 1991
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity ProblemsMathematics of Operations Research, 1990
- Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!Informs Journal on Applied Analytics, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989