A Weighted-Path-Following Method for Monotone Horizontal Linear Complementarity Problem

DOI10.1007/978-3-540-88914-4_59zbMath1211.90251OpenAlexW121082344MaRDI QIDQ3079427

Yu-Jing Yue, Xin-Zhong Cai, Guo-Qiang Wang

Publication date: 2 March 2011

Published in: Advances in Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88914-4_59

zbMATH Keywords

interior-point methodsiteration boundsmall-update methodhorizontal linear complementarity problems

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP ⋮ Complexity analysis of a weighted-full-Newton step interior-point algorithm forP_∗(κ)-LCP ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ A polynomial-time weighted path-following interior-point algorithm for linear optimization ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems