On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm

DOI10.1016/J.ORL.2018.10.003MaRDI QIDQ2294243zbMATH OpenOpenAlexFDO

Authors Salihah Alwadani, Heinz H. Bauschke, Walaa M. Moursi, Xianfu Wang

Publication date 10 February 2020

Published in Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

convex functionmaximally monotone operatorDouglas-Rachford algorithmproximal averageresolvent averageAragón Artacho-Campoy algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)

Abstract: Arag'on Artacho and Campoy recently proposed a new method for computing the projection onto the intersection of two closed convex sets in Hilbert space; moreover, they proposed in 2018 a generalization from normal cone operators to maximally monotone operators. In this paper, we complete this analysis by demonstrating that the underlying curve converges to the nearest zero of the sum of the two operators. We also provide a new interpretation of the underlying operators in terms of the resolvent and the proximal average.

Recommendations

• On the asymptotic behavior of some algorithms
• Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
• Towards an asymptotic analysis of Karmarkar's algorithm
• Asymptotic behavior of two algorithms for solving common fixed point problems
• On the choice of almost-optimal parameters in algorithms of Arrow-Hurwicz type
• On asymptotic estimates for arithmetic cost functions
• Convergence properties of ART and SOR algorithms
• On the almost sure asymptotic behaviour of stochastic algorithm
• scientific article; zbMATH DE number 819105

Cites work

• A new projection method for finding the closest point in the intersection of convex sets
• Approximating curves for nonexpansive and monotone operators
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• Convex analysis and monotone operator theory in Hilbert spaces
• Iterative construction of the resolvent of a sum of maximal monotone operators
• The Proximal Average: Basic Theory
• The resolvent average of monotone operators: dominant and recessive properties
• Visco-penalization of the sum of two monotone operators

Cited in

(6)

• Computing the resolvent of the sum of operators with application to best approximation problems
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Strengthened splitting methods for computing resolvents
• A product space reformulation with reduced dimension for splitting algorithms
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• A parameterized Douglas-Rachford algorithm

This page was built for publication: On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm

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