An inertial extrapolation method for multiple-set split feasibility problem
type: Item
instance of: scholarly article
title: An inertial extrapolation method for multiple-set split feasibility problem
zbMATH Open document ID: 1487.47113
author: Guash Haile Taddele
author: Poom Kumam
author: Anteneh Getachew Gebrie
published in: Journal of Inequalities and Applications
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 65J15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 7461018
zbMATH Keywords: multiple-set split feasibility problem
zbMATH Keywords: sublevel set
zbMATH Keywords: subdifferential
zbMATH Keywords: inertial extrapolation
zbMATH Keywords: self-adaptive technique
zbMATH Keywords: strong convergence
MaRDI profile type: Publication
full work available at URL: s13660-020-02508-4
OpenAlex ID: W3101877570
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Robust solutions of split feasibility problem with uncertain linear operator
cites work: Generalized KM theorems and their applications
cites work: Two projection algorithms for solving the split common fixed point problem
cites work: Q4010376
cites work: Q4903673
cites work: Split Feasibility and Fixed Point Problems
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Implicit and explicit algorithms for solving the split feasibility problem
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: Several solution methods for the split feasibility problem
cites work: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
cites work: Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
cites work: Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
cites work: A relaxed projection method for variational inequalities
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Parallel Iterative Methods for Solving the Split Common Fixed Point Problem in Hilbert Spaces
cites work: Parallel proximal method of solving split system of fixed point set constraint minimization problems
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Algorithms for the split variational inequality problem
cites work: Split monotone variational inclusions
cites work: Several iterative algorithms for solving the split common fixed point problem of directed operators with applications
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: Q5858976
cites work: Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
cites work: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: Self-adaptive projection methods for the multiple-sets split feasibility problem
cites work: Several acceleration schemes for solving the multiple-sets split feasibility problem
cites work: Q5445188
cites work: Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
cites work: Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
cites work: Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
cites work: A cyclic iterative method for solving Multiple Sets Split Feasibility Problems in Banach Spaces
cites work: Gradient methods with selection technique for the multiple-sets split feasibility problem
cites work: Q4355647
cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization
cites work: Viscosity approximation methods for fixed-points problems
cites work: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
cites work: An inertial forward-backward algorithm for monotone inclusions
cites work: Convergence theorems for inertial KM-type algorithms
cites work: Q3322631
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
cites work: Iterative Algorithms for Nonlinear Operators
cites work: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
cites work: Iterative methods for fixed point problems in Hilbert spaces
cites work: Strong convergence result of split feasibility problems in Banach spaces
DOI: 10.1186/S13660-020-02508-4
description: scientific article; zbMATH DE number 7461018