Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems

Authors: Anja Fischer, Jeya Jeyakumar, Đinh Thế Lục,

https://doi.org/10.1023/A:1017580126509

Publisher, magazine: ,

Publication year: 2001

  Lưu        Trích dẫn         Chia sẻ

Abstract

We consider a nonlinear complementarity problem defined by a continuous but not necessarily locally Lipschitzian map. In particular, we examine the connection between solutions of the problem and stationary points of the associated Fischer-Burmeister merit function. This is done by deriving a new necessary optimality condition and a chain rule formula for composite functions involving continuous maps. These results are given in terms of approximate Jacobians which provide the foundation for analyzing continuous nonsmooth maps. We also prove a result on the global convergence of a derivative-free descent algorithm for solving the complementarity problem. To this end, a concept of directional monotonicity for continuous maps is introduced.

Tags: Approximate Jacobians; nonsmooth continuous maps; complementarity problems; nonsmooth analysis; descent algorithms