A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques

DOI10.1007/s101070050081zbMath0978.90097OpenAlexW1985538244MaRDI QIDQ1806026

James V. Burke, Song Xu

Publication date: 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050081

zbMATH Keywords

linear complementarityinterior point methodpath followingpolynoial complexity

Mathematics Subject Classification ID

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

Related Items

A new path-following algorithm for nonlinear \(P_*\) complementarity problems, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, Complexity of a noninterior path-following method for the linear complementarity problem, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Unnamed Item, An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function, An interior point parameterized central path following algorithm for linearly constrained convex programming