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

DOI10.1137/0801007MaRDI QIDQ4017640zbMATH OpenOpenAlexFDO

Authors J. 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

polynomial-time algorithmpositive semidefinite matricespredictor-corrector methodlinear complementarityhomotopy path

Mathematics Subject Classification ID

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

Recommendations

• A polynomial-time algorithm for a class of linear complementarity problems
• A new polynomial time method for a linear complementarity problem
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems

Cited in

(11)

• A polynomial-time algorithm for a class of linear complementarity problems
• A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
• Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
• The implementation of linear programming algorithms based on homotopies
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• scientific article; zbMATH DE number 6129935 (Why is no real title available?)
• A derivative-free optimization algorithm based on conditional moments
• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming

This page was built for publication: A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017640)