A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems

DOI10.1137/0801007zbMath0752.90079OpenAlexW2028499981MaRDI QIDQ4017640

Jiu Ding, Tien-Yien Li

Publication date: 16 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801007

zbMATH Keywords

linear complementaritypredictor-corrector methodpolynomial-time algorithmpositive semidefinite matriceshomotopy path

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem, The implementation of linear programming algorithms based on homotopies, A derivative-free optimization algorithm based on conditional moments, A continuation algorithm for a class of linear complementarity problems using an extrapolation technique