On the Proximal Point Algorithm
✍ Scribed by B. Djafari Rouhani; H. Khatibzadeh
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 225 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper illustrates that the conditions and the main proof of two main theorems of Verma [R.U. Verma, The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications, Computers and Mathematics with Applications 55 (2008) 2673-2679] concerning the strong convergen
First the general framework for a generalized over-relaxed proximal point algorithm using the notion of H -maximal monotonicity (also referred to as H -monotonicity) is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion pr