High order long-step methods for solving linear complementarity problems

DOI10.1023/A:1012951021320zbMath1056.90133MaRDI QIDQ5959293

Josef Stoer

Publication date: 26 March 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (10)

Sufficient weighted complementarity problems ⋮ On a special class of regularized central paths for semidefinite programs ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ A homotopy method for solving the horizontal linear complementarity problem ⋮ A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs

This page was built for publication: High order long-step methods for solving linear complementarity problems