88. A modified proximal point algorithm involving generalized nonexpansive mappings
Invited abstract in session MC-6: Nonsmooth optimization: from continuous to discrete Part II, stream Nonsmooth and nonconvex optimization.
Monday, 14:00-16:00Room: B100/7013
Authors (first author is the speaker)
| 1. | Izhar Uddin
|
| MATHEMATICS, JAMIA MILLIA ISLAMIA |
Abstract
In this paper, we propose a modified proximal point algorithm based on M-iteration to approximate a common element of the solution sets of convex minimization problems and the fixed points of nearly asymptotically quasi-nonexpansive mappings in CAT(0) spaces. Additionally, we establish some convergence results of the proposed algorithm for solving both the minimization and fixed point problems. We also present an application and provide numerical results demonstrating the effectiveness of our algorithm.
Keywords
- Global optimization
- Linear and nonlinear optimization
- Computational mathematical optimization
Status: accepted
Back to the list of papers