High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems

DOI10.1287/MOOR.23.4.832zbMath0977.90065OpenAlexW1993891506MaRDI QIDQ2757568

Shinji Mizuno, Josef Stoer, Martin Wechs

Publication date: 26 November 2001

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

Full work available at URL: https://doi.org/10.1287/moor.23.4.832

zbMATH Keywords

linear complementarity problemshigh-order methodsinterior-point methods

Mathematics Subject Classification ID

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

Related Items (21)

Sufficient weighted complementarity problems ⋮ On a special class of regularized central paths for semidefinite programs ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ 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 ⋮ An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Two simple proofs for analyticity of the central path in linear programming. ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ Unnamed Item ⋮ A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs ⋮ Analyticity of the central path at the boundary point in semidefinite programming ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP ⋮ An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem

This page was built for publication: High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems