A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP

DOI10.1023/A:1019754720598MaRDI QIDQ1812092zbMATHOpenAlexFDO

Authors Keisuke Hotta, Akiko Yoshise

Publication date 18 June 2003

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019754720598

Mathematics Subject Classification ID

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

Recommendations

• A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
• Predictor-corrector smoothing methods for monotone LCP
• A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
• The locally Chen-Harker-Kanzow-Smale smoothing functions for mixed complementarity problems
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

Cited in

(3)

• A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems
• Predictor-corrector smoothing methods for monotone LCP

This page was built for publication: A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP

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