Conical averagedness and convergence analysis of fixed point algorithms

DOI10.1007/s10898-021-01057-4zbMath1497.47107arXiv1910.14185OpenAlexW3191428020MaRDI QIDQ2114584

Sedi Bartz, Minh N. Dao, Hung M. Phan

Publication date: 15 March 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.14185

zbMATH Keywords

strong monotonicityproximal point algorithmforward-backward algorithmweak monotonicitycocoercivityadaptive Douglas-Rachford algorithmconically averaged operator

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Decomposition methods (49M27) Fixed-point iterations (47J26)

Related Items (7)

An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem ⋮ Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ An adaptive alternating direction method of multipliers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Compositions and convex combinations of averaged nonexpansive operators
• Algorithms based on unions of nonexpansive maps
• Weak convergence theorems for nonexpansive mappings in Banach spaces
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Tight global linear convergence rate bounds for Douglas-Rachford splitting
• Computing the resolvent of the sum of operators with application to best approximation problems
• Generalized monotone operators and their averaged resolvents
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• Set-valued mappings and enlargement of monotone operators.
• Strong and Weak Convexity of Sets and Functions
• Krasnoselski-Mann Iterations in Normed Spaces
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
• Proximal Methods for Cohypomonotone Operators
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
• Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
• Convex programming in Hilbert space
• Mean Value Methods in Iteration
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Conical averagedness and convergence analysis of fixed point algorithms