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

DOI10.1023/A:1019754720598zbMath1033.90134OpenAlexW1532963745MaRDI QIDQ1812092

Akiko Yoshise, Keisuke Hotta

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

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

Related Items (1)

Some non-interior path-following methods based on a scaled central path for linear complementarity problems

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