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

DOI10.1007/S101070050081zbMATH Open0978.90097OpenAlexW1985538244MaRDI QIDQ1806026FDOQ1806026

Authors: Song Xu, James V. Burke 

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

Recommendations

• Complexity of a noninterior path-following method for the linear complementarity problem
• A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

zbMATH Keywords

interior point methodlinear complementaritypath followingpolynoial complexity

Mathematics Subject Classification ID

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

Cited In (9)

• Complexity of a noninterior path-following method for the linear complementarity problem
• A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP
• Standard embedding for linear complementarity problems
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
• Complementarity problems over symmetric cones: A survey of recent developments in several aspects
• 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

This page was built for publication: A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806026)