A path following method for LCP with superlinearly convergent iteration sequence
From MaRDI portal
Publication:1265875
DOI10.1023/A:1018942131812zbMath0906.90163MaRDI QIDQ1265875
Florian A. Potra, Rongqin Sheng
Publication date: 18 February 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
linear complementaritysuperlinear convergencesufficient matricespath-followinginfeasible-interior-point algorithm\(P_*\)-matrices
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (5)
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function ⋮ How Many Steps Still Left to $x$*?
This page was built for publication: A path following method for LCP with superlinearly convergent iteration sequence
