Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces
Summary: We study the approximate split equality problem (ASEP) in the framework of infinite-dimensional Hilbert spaces. Let \(H_1\), \(H_2\), and \(H_3\) be infinite-dimensional real Hilbert spaces, let \(C \subset H_1\) and \(Q \subset H_2\) be two nonempty closed convex sets, and let \(A : H_1 \to H_3\) and \(B : H_2 \to H_3\) be two bounded linear operators. The ASEP in infinite-dimensional Hilbert spaces is to minimize the function \(f(x, y) = (1/2)||Ax - By||^2_2\) over \(x \in C\) and \(y \in Q\). Recently, Moudafi and Byrne had proposed several algorithms for solving the split equality problem and proved their convergence. Note that their algorithms have only weak convergence in infinite-dimensional Hilbert spaces. In this paper, we use the regularization method to establish a single-step iterative for solving the ASEP in infinite-dimensional Hilbert spaces and show that the sequence generated by such an algorithm strongly converges to the minimum-norm solution of the ASEP. Note that, by taking \(B = I\) in the ASEP, we recover the approximate split feasibility problem (ASFP).
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- A regularization algorithm for a splitting feasibility problem in Hilbert spaces
- Strong convergence of iterative algorithms for the split equality problem
- General alternative regularization methods for split equality common fixed-point problem
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- A new halfspace-relaxation projection method for the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- A relaxed alternating CQ-algorithm for convex feasibility problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Alternating CQ-algorithms for convex feasibility and split fixed-point problems
- Convergence of hybrid steepest-descent methods for variational inequalities
- scientific article; zbMATH DE number 687723 (Why is no real title available?)
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Several solution methods for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms
- Regularization methods for the split equality problems in Hilbert spaces
- Iterative methods for solving a class of monotone variational inequality problems with applications
- General split equality problems in Hilbert spaces
- Hybrid simultaneous algorithms for the split equality problem with applications
This page was built for publication: Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370230)
