An algorithm based on the generalized D-gap function for equilibrium problems
β Scribed by Liping Zhang; Soon-Yi Wu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 574 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
The equilibrium problem (EP) can be reformulated as an unconstrained minimization problem through the generalized D-gap function. In this paper, we propose an algorithm for minimizing the problem and analyze some convergence properties of the proposed algorithm. Under some reasonable conditions, we show that the iteration sequence generated by the algorithm is globally convergent and converges to a solution to the EP and the generalized D-gap function provides a global error bound for the algorithm.
π SIMILAR VOLUMES
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
Based on the generalized CP-function proposed by Hu et al.