A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
DOI10.22130/scma.2019.100821.542zbMath1438.47121OpenAlexW2990266209MaRDI QIDQ5241661
Sirous Moradi, Somaye Jafari, Mohsen Tahernia
Publication date: 1 November 2019
Full work available at URL: https://scma.maragheh.ac.ir/article_36660_2dd27eb6ca24133e2c7b42b563bb1c1b.pdf
strong convergencemaximal monotone operatorresolvent operatornonexpansive mapproximal point algorithm
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Set-valued operators (47H04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A contraction proximal point algorithm with two monotone operators
- On the method of alternating resolvents
- The asymptotic behavior of the composition of two resolvents
- A regularization method for the proximal point algorithm
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Projection and proximal point methods: Convergence results and counterexamples.
- An alternating projection that does not converge in norm
- Adaptive subgradient method for the split quasi-convex feasibility problems
- A new approximation method for common fixed points of a finite family of nonexpansive non-self mappings in Banach spaces
- The spectral properties of differential operators with matrix coefficients on elliptic systems with boundary conditions
- The Method of Alternating Resolvents Revisited
This page was built for publication: A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators