Inexact Halpern-type proximal point algorithm
From MaRDI portal
Publication:652665
DOI10.1007/s10898-010-9616-7zbMath1295.47073OpenAlexW2077177249MaRDI QIDQ652665
Gheorghe Morosanu, Oganeditse Aaron Boikanyo
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9616-7
strong convergenceconvex functionmonotone operatorminimizerproximal point algorithmminimum valueprox-Tikhonov algorithmcontrol conditions
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
On the strong convergence of Halpern type proximal point algorithm ⋮ Four parameter proximal point algorithms ⋮ A proximal point method involving two resolvent operators ⋮ On the contraction-proximal point algorithms with multi-parameters ⋮ Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems ⋮ Halpern-type proximal point Algorithm in \(\mathrm{CAT}(0)\) spaces ⋮ Strongly convergent inertial proximal point algorithm without on-line rule ⋮ A contraction proximal point algorithm with two monotone operators ⋮ On proximal gradient method for the convex problems regularized with the group reproducing kernel norm ⋮ Unnamed Item ⋮ A strong convergence algorithm for the two-operator split common fixed point problem in Hilbert spaces ⋮ General proximal-point algorithm for monotone operators ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces ⋮ Quantitative results on a Halpern-type proximal point algorithm ⋮ Quantitative translations for viscosity approximation methods in hyperbolic spaces ⋮ A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces ⋮ Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proximal point algorithm converging strongly for general errors
- A regularization method for the proximal point algorithm
- A note on a paper ``A regularization method for the proximal point algorithm
- Approximation of fixed points of nonexpansive mappings
- Approximating solutions of maximal monotone operators in Hilbert spaces
- Iterative approximation of fixed points of nonexpansive mappings
- Convergence of approximants to fixed points of nonexpansive nonlinear mappings in Banach spaces
- Iterative Algorithms for Nonlinear Operators
- A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
- Monotone Operators and the Proximal Point Algorithm
- Fixed points of nonexpanding maps
- Combining The Proximal Algorithm And Tikhonov Regularization
- Introduction to global optimization.