New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces

DOI10.1155/2021/6624509zbMath1480.47089OpenAlexW3129736314MaRDI QIDQ2034949

Yulian Wu, Hai Ying Li, Feng Hui Wang

Publication date: 23 June 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/6624509

zbMATH Keywords

strong convergenceweak convergencesplit feasibility problemreal Hilbert spaceinertial relaxed \(CQ\) algorithms

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Related Items

An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications

Uses Software

• MiKM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the variational inequality problem defined on intersection of finite level sets
• Regularized methods for the split feasibility problem
• On the convergence of CQ algorithm with variable steps for the split equality problem
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
• Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• A new self-adaptive CQ algorithm with an application to the LASSO problem
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Inertial projection and contraction algorithms for variational inequalities
• General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
• New inertial relaxed method for solving split feasibilities
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Iterative methods for finding the minimum-norm solution of the standard monotone variational inequality problems with applications in Hilbert spaces
• Inertial accelerated algorithms for solving a split feasibility problem
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
• A new halfspace-relaxation projection method for the split feasibility problem
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
• A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
• Fixed Point Theory for Lipschitzian-type Mappings with Applications
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

This page was built for publication: New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces