𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems

✍ Scribed by O.L. Mangasarian; M.V. Solodov

Book ID
110267192
Publisher
Springer US
Year
1999
Tongue
English
Weight
63 KB
Volume
14
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An -linearly convergent derivative-free
An -linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer–Burmeister merit function
✍ Jein-Shan Chen; Hung-Ta Gao; Shaohua Pan πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 967 KB

the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the nonlinear complementarity problem, Computational Optimization and Applications, 40 (2008) 389-404], the authors proposed a derivative-free descent algorithm for nonlinear complementarity problems (NCPs) by the gene

A globally convergent derivative-free me
A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
✍ Qin-Rong Yan; Xiao-Zhen Peng; Dong-Hui Li πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 294 KB

In this paper, we propose two derivative-free iterative methods for solving nonlinear monotone equations, which combines two modified HS methods with the projection method in Solodov and Svaiter (1998) . The proposed methods can be applied to solve nonsmooth equations. They are suitable to large-sca