Two inertial-type algorithms for solving the split feasibility problem

DOI10.1080/02331934.2022.2070066zbMath1528.90194OpenAlexW4280494256MaRDI QIDQ6048274

Seak Weng Vong, Zhongsheng Yao

Publication date: 10 October 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2022.2070066

zbMATH Keywords

split feasibility problemCQ algorithminertial factorrelaxed splitting method

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Solving proximal split feasibility problems without prior knowledge of operator norms
• An algorithm for a class of split feasibility problems: application to a model in electricity production
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• Convergence theorems for inertial KM-type algorithms
• A multiprojection algorithm using Bregman projections in a product space
• An inertial Mann algorithm for nonexpansive mappings
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
• An inertial method for solving split common fixed point problems
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• On variable-step relaxed projection algorithm for variational inequalities
• General splitting methods with linearization for the split feasibility problem
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• New inertial relaxed method for solving split feasibilities
• Non-convex split Feasibility problems: models, algorithms and theory
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Inertial accelerated algorithms for solving a split feasibility problem
• A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
• New inertial method for generalized split variational inclusion problems
• Solving the split equality problem without prior knowledge of operator norms
• The extragradient algorithm with inertial effects for solving the variational inequality
• Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Some methods of speeding up the convergence of iteration methods
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Two inertial-type algorithms for solving the split feasibility problem