Strong convergence of a proximal point algorithm with bounded error sequence

DOI10.1007/s11590-011-0418-8zbMath1267.90171OpenAlexW2095426926MaRDI QIDQ1940445

Gheorghe Morosanu, Oganeditse Aaron Boikanyo

Publication date: 7 March 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0418-8

zbMATH Keywords

maximal monotone operatorresolvent operatornonexpansive mapproximal point algorithmprox-Tikhonov method

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items

The generalized contraction proximal point algorithm with square-summable errors ⋮ On the weak and strong convergence of the proximal point algorithm in reflexive Banach spaces ⋮ Strong convergence of two proximal point algorithms with possible unbounded error sequences ⋮ New inertial proximal gradient methods for unconstrained convex optimization problems ⋮ A generalized contraction proximal point algorithm with two monotone operators ⋮ A proximal point algorithm revisited and extended

Cites Work

• Unnamed Item
• Fifty years of maximal monotonicity
• A proximal point algorithm converging strongly for general errors
• A regularization method for the proximal point algorithm
• Nonlinear analysis and variational problems. In Honor of George Isac
• Monotone (nonlinear) operators in Hilbert space
• Approximating solutions of maximal monotone operators in Hilbert spaces
• A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space
• Iterative Algorithms for Nonlinear Operators
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• A new proximal point iteration that converges weakly but not in norm
• Combining The Proximal Algorithm And Tikhonov Regularization

This page was built for publication: Strong convergence of a proximal point algorithm with bounded error sequence