A convergent relaxation of the Douglas-Rachford algorithm

DOI10.1007/s10589-018-9989-yzbMath1393.90099arXiv1709.05984OpenAlexW2964142159WikidataQ90102335 ScholiaQ90102335MaRDI QIDQ721957

Nguyen Hieu Thao

Publication date: 20 July 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

transversalityPicard iterationmetric subregularityDouglas-Rachford methodalternating projection methodalmost averagednesscollection of setsKrasnoselski-Mann relaxationRAAR algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Set-valued and variational analysis (49J53) Decomposition methods (49M27)

Related Items (6)

Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Phase Retrieval with Sparse Phase Constraint

Uses Software

• UNLocBoX
• ProxToolbox

Cites Work

• Unnamed Item
• Unnamed Item
• On local convergence of the method of alternating projections
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Nonlinear regularity models
• Restricted normal cones and the method of alternating projections: applications
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Restricted normal cones and sparsity optimization with affine constraints
• About \([q\)-regularity properties of collections of sets]
• About subtransversality of collections of sets
• Local linear convergence for alternating and averaged nonconvex projections
• Transversality and alternating projections for nonconvex sets
• Optimization methods and stability of inclusions in Banach spaces
• About stationarity and regularity in variational analysis
• Nonsmooth equations in optimization. Regularity, calculus, methods and applications
• Quantitative characterizations of regularity properties of collections of sets
• Set regularities and feasibility problems
• About regularity of collections of sets
• Linear convergence of the Douglas–Rachford method for two closed sets
• Regularity of collections of sets and convergence of inexact alternating projections
• Proximal Splitting Methods in Signal Processing
• Calculus Without Derivatives
• METRIC REGULARITY—A SURVEY PART 1. THEORY
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
• Regularity on a Fixed Set
• An Induction Theorem and Nonlinear Regularity Models
• Decoding by Linear Programming
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Metric regularity and subdifferential calculus
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Relaxed averaged alternating reflections for diffraction imaging
• On Projection Algorithms for Solving Convex Feasibility Problems
• Error bounds and metric subregularity
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• About uniform regularity of collections of sets
• Alternating Projections on Manifolds
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Implicit Functions and Solution Mappings
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A convergent relaxation of the Douglas-Rachford algorithm