Weak and linear convergence of proximal point algorithm with reflections

MaRDI QIDQ5049783zbMATH OpenFDO

Authors Y. Shehu, Xiaolong Qin, Jen-Chih Yao

Publication date 14 November 2022

Full work available at URL http://yokohamapublishers.jp/online2/opjnca/vol22/p299.html

zbMATH Keywords

Hilbert spaceslinear ratereflected proximal point algorithmweak convergence

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15) Convex programming (90C25)

Recommendations

• On the weak and strong convergence of the proximal point algorithm in reflexive Banach spaces
• On the proximal point algorithm
• Strong and weak convergence of the modified proximal point algorithms in Hilbert space
• Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
• Forcing strong convergence of proximal point iterations in a Hilbert space

Cited in

(6)

• A strongly convergent hybrid proximal method in Banach spaces.
• An implicit algorithm for finding a fixed point of a \(Q\)-nonexpansive mapping in locally convex spaces
• Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings
• Self-adaptive iterative algorithms for the split common fixed point problem with demicontractive operators
• A simple strong convergent method for solving split common fixed point problems
• A new proximal point iteration that converges weakly but not in norm

This page was built for publication: Weak and linear convergence of proximal point algorithm with reflections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049783)