Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
From MaRDI portal
Abstract: In this paper, we propose a new algorithm combining the Douglas-Rachford (DR) algorithm and the Frank-Wolfe algorithm, also known as the conditional gradient (CondG) method, for solving the classic convex feasibility problem. Within the algorithm, which will be named {it Approximate Douglas-Rachford (ApDR) algorithm}, the CondG method is used as a subroutine to compute feasible inexact projections on the sets under consideration, and the ApDR iteration is defined based on the DR iteration. The ApDR algorithm generates two sequences, the main sequence, based on the DR iteration, and its corresponding shadow sequence. When the intersection of the feasible sets is nonempty, the main sequence converges to a fixed point of the usual DR operator, and the shadow sequence converges to the solution set. We provide some numerical experiments to illustrate the behaviour of the sequences produced by the proposed algorithm.
Recommendations
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Alternating conditional gradient method for convex feasibility problems
- On the local convergence of the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
Cites work
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A Newton conditional gradient method for constrained nonlinear systems
- Alternating conditional gradient method for convex feasibility problems
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Conditional gradient sliding for convex optimization
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Convex analysis and monotone operator theory in Hilbert spaces
- Douglas-Rachford feasibility methods for matrix completion problems
- Hard-constrained inconsistent signal feasibility problems
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- New analysis and results for the Frank-Wolfe method
- Newton's method with feasible inexact projections for solving constrained generalized equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Projection-free accelerated method for convex optimization
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Smoothing functions for second-order-cone complementarity problems
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
Cited in
(6)- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- A Two-Riccati, Feasible Algorithm for Guaranteeing Output L∞ Constraints
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
- Extragradient method with feasible inexact projection to variational inequality problem
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
This page was built for publication: Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173957)
