Abstract
We propose two algorithms for finding (common) zeros of finitely many maximal monotone mappings in reflexive Banach spaces. These algorithms are based on the Bregman distance related to a well-chosen convex function and improve previous results. Finally, we mention two applications of our algorithms for solving equilibrium problems and convex feasibility problems.
| Original language | English |
|---|---|
| Pages (from-to) | 1289-1308 |
| Number of pages | 20 |
| Journal | SIAM Journal on Optimization |
| Volume | 21 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2011 |
Keywords
- Banach space
- Bifunction
- Bregman projection
- Convex feasibility problem
- Equilibrium problem
- Legendre function
- Monotone mapping
- Proximal point algorithm
- Resolvent
- Totally convex function
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science