The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems

DOI10.1080/10556789808805721zbMath0947.90118OpenAlexW1983620101MaRDI QIDQ4946716

Martin Wechs, Josef Stoer

Publication date: 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805721

zbMATH Keywords

sufficient matriceshorizontal linear complementarity problemsinfeasible interior-point-paths

Mathematics Subject Classification ID

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

Related Items (5)

Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function

This page was built for publication: The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems