A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood

DOI10.1142/S0218127415400350MaRDI QIDQ2800675zbMATH OpenOpenAlexFDO

Authors Xiaojue Ma, Chang Zhou, Hongwei Liu

Publication date 18 April 2016

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218127415400350

zbMATH Keywords

polynomial complexitywide neighborhoodpredictor-correctorinterior-point methodmonotone LCP

Mathematics Subject Classification ID

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

Recommendations

• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
• A new predictor-corrector large-update interior-point algorithm for nonmonotone linear complementarity problems
• A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
• An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem

Cites work

• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path

Cited in

(11)

• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
• A large-update predictor-correcting algorithm for linear complementarity problem
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems
• An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
• A Mehrotra predictor-corrector algorithm for linear complementarity problem
• Wide-neighborhood predictor-corrector algorithm for a class of nonlinear complementarity problem
• A new predictor-corrector large-update interior-point algorithm for nonmonotone linear complementarity problems
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

This page was built for publication: A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood

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