A combined homotopy interior point method for the linear complementarity problem
The authors propose a homotopy interior point algorithm for the linear programming complementarity problem. Starting from any interior point, it follows a smooth homotopy path to reaching the solution by using a predictor-corrector technique. Convergence properties are discussed and a numerical example is given.
scientific article; zbMATH DE number 5069145