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

DOI10.1016/j.orl.2018.10.003zbMath1481.47079arXiv1805.11165OpenAlexW2963290245MaRDI QIDQ2294243

Heinz H. Bauschke, Walaa M. Moursi, Salihah Alwadani, Shawn 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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• A new projection method for finding the closest point in the intersection of convex sets
• Visco-penalization of the sum of two monotone operators
• The Resolvent Average of Monotone Operators: Dominant and Recessive Properties
• The Proximal Average: Basic Theory
• Convex analysis and monotone operator theory in Hilbert spaces

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