Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems

DOI10.1007/s10898-022-01264-7zbMath1515.65151arXiv2105.13005OpenAlexW3164811209MaRDI QIDQ6173957

R. Díaz Millán, Orizon P. Ferreira, Julien Ugon

Publication date: 13 July 2023

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

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

zbMATH Keywords

convex feasibility problem conditional gradient method Frank-Wolfe algorithm Douglas-Rachford algorithm inexact projections

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

Unnamed Item
A Newton conditional gradient method for constrained nonlinear systems
Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
Newton's method with feasible inexact projections for solving constrained generalized equations
A conditional gradient method with linear rate of convergence for solving convex linear systems
Alternating conditional gradient method for convex feasibility problems
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
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
Hard-constrained inconsistent signal feasibility problems
Smoothing Functions for Second-Order-Cone Complementarity Problems
Conditional Gradient Sliding for Convex Optimization
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
The Matching Polytope has Exponential Extension Complexity
Projection-free accelerated method for convex optimization
Convex analysis and monotone operator theory in Hilbert spaces
New analysis and results for the Frank-Wolfe method

This page was built for publication: Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems