A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems

DOI10.1023/A:1026550331760zbMath1168.90621OpenAlexW1538102214MaRDI QIDQ1841556

Akiko Yoshise, Masatora Inaba, Keisuke Hotta

Publication date: 18 February 2001

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

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

zbMATH Keywords

monotonicitylinear complementarity problemcomplexity boundsmoothing method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (4)

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 ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Complexity of a noninterior path-following method for the linear complementarity problem ⋮ An exterior point polynomial-time algorithm for convex quadratic programming

This page was built for publication: A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems