New inertial relaxed method for solving split feasibilities
type: Item
instance of: scholarly article
title: New inertial relaxed method for solving split feasibilities
zbMATH Open document ID: 1475.90061
author: Y. Shehu
author: Aviv Gibali
published in: Optimization Letters
publication date: 2021-08-19T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7383567
zbMATH Keywords: alternated inertial
zbMATH Keywords: CQ methods
zbMATH Keywords: split feasibility problems
zbMATH Keywords: signal processing
MaRDI profile type: Publication
full work available at URL: s11590-020-01603-1
OpenAlex ID: W3033886262
cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Inertial Douglas-Rachford splitting for monotone inclusion problems
cites work: An inertial alternating direction method of multipliers
cites work: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: An iterative row-action method for interval convex programming
cites work: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
cites work: Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Inertial accelerated algorithms for solving a split feasibility problem
cites work: Double projection algorithms for solving the split feasibility problems
cites work: ``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem
cites work: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
cites work: A relaxed projection method for variational inequalities
cites work: Note on the modified relaxation CQ algorithm for the split feasibility problem
cites work: Q3998720
cites work: Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
cites work: A generic online acceleration scheme for optimization algorithms via relaxation and inertia
cites work: On the proximal gradient algorithm with alternated inertia
cites work: Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: An inertial forward-backward algorithm for monotone inclusions
cites work: Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
cites work: A First-Order Primal-Dual Algorithm with Linesearch
cites work: Convergence of a splitting inertial proximal method for monotone operators
cites work: Accelerated alternating minimization algorithm for Poisson noisy image recovery
cites work: Q3320132
cites work: A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces
cites work: Some methods of speeding up the convergence of iteration methods
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: An iterative regularization method for the solution of the split feasibility problem in Banach spaces
cites work: Iterative methods for split feasibility problems in certain Banach spaces
cites work: An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
cites work: A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
cites work: Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
cites work: Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
cites work: Q4864293
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Q5160307
cites work: The ball-relaxed CQ algorithms for the split feasibility problem
DOI: 10.1007/S11590-020-01603-1
description: scientific article; zbMATH DE number 7383567