A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
A new algorithm is proposed for solving mathematical programs with linear complementarity problems. The advantage of the new algorithm is that it is globally convergent without requiring strong assumptions such as nondegeneracy or linear independence condition. Numerical results show the effectiveness of the algorithm. The proofs of the results are nice pieces of fine analysis. The features of the paper constitute a valuable tool for researchers.
scientific article; zbMATH DE number 2130179
scientific article