The strong convergence of Douglas-Rachford methods for the split feasibility problem

DOI10.1007/978-3-030-84721-0_12MaRDI QIDQ2080607zbMATH OpenOpenAlexFDO

Authors Qiao-Li Dong, Lulu Liu, Themistocles M. Rassias

Publication date 9 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-84721-0_12

Mathematics Subject Classification ID

Operator theory (47-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• A cyclic Douglas-Rachford iteration scheme
• Strong convergence of the modified projection and contraction methods for split feasibility problem
• The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
• A new iterative method for the split feasibility problem

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• An algorithm for a class of split feasibility problems: application to a model in electricity production
• Analysis on Newton projection method for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Double projection algorithms for solving the split feasibility problems
• General splitting methods with linearization for the split feasibility problem
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Nonlinear iteration method for proximal split feasibility problems
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Optimal parameter selections for a general Halpern iteration
• Outer perturbations of a projection method and two approximation methods for the split equality problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• Solving the variational inequality problem defined on intersection of finite level sets
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Strong convergence of two algorithms for the split feasibility problem in Banach spaces
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• The selective projection method for convex feasibility and split feasibility problems
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces

Cited in

(6)

• Strong convergence on the split feasibility problem by mixing W-mapping
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
• Douglas-Rachford splitting method for semidefinite programming
• A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
• Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
• An inertial conjugate gradient projection method for the split feasibility problem

This page was built for publication: The strong convergence of Douglas-Rachford methods for the split feasibility problem

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