Two relaxed CQ methods for the split feasibility problem with multiple output sets

DOI10.1007/S40840-023-01647-3MaRDI QIDQ6192033zbMATH OpenOpenAlexFDO

Authors Nguyen Thi Thu Thuy, T.-T. Tung

Publication date 11 March 2024

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-023-01647-3

zbMATH Keywords

strong convergencesplit feasibility problemsself-adaptiverelaxed CQ algorithmmultiple output sets

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Inverse problems in optimal control (49N45) Numerical solutions to equations with nonlinear operators (65J15)

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A relaxed projection method for variational inequalities
• A self-adaptive step size algorithm for solving variational inequalities with the split feasibility problem with multiple output sets constraints
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Implicit and explicit algorithms for solving the split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Perturbed projections and subgradient projections 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
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The split feasibility problem with multiple output sets for demicontractive mappings
• The split feasibility problem with multiple output sets in Hilbert spaces

Cited in

(1)

• A new algorithm for approximating solutions of the common variational inclusion

This page was built for publication: Two relaxed CQ methods for the split feasibility problem with multiple output sets

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