登入選單
返回Google圖書搜尋
註釋Burke and Ferris (1993) have introduced sufficient conditions for the finite identification, by iterative algorithms, of local minima associated with mathematical programs. They introduced the notion of a weak sharp minimum, which extends the notion of a sharp or strongly unique minimum to mathematical programs admitting non-isolated local minima. This paper extends their results and those of Al-Khayyal and Kyparisis (1991) to generalized monotone variational inequalities, and provides a characterization of their solution sets. Sufficient conditions are given for the finite convergence of descent algorithms for solving variational inequalities involving generalized monotone mappings.