A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
type: Item
instance of: scholarly article
title: A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
zbMATH Open document ID: 1415.47010
author: Y. Shehu
author: Phan Tu Vuong
author: Prasit Cholamjiak
published in: Journal of Fixed Point Theory and Applications
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 47H06
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 47J05
zbMATH DE Number: 7075058
zbMATH Keywords: split feasibility problem
zbMATH Keywords: strong convergence
zbMATH Keywords: self-adaptive method
zbMATH Keywords: inertial technique
zbMATH Keywords: Banach space
MaRDI profile type: Publication
full work available at URL: s11784-019-0684-0
OpenAlex ID: W2937942925
Wikidata QID: Q113106009
cites work: Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
cites work: Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
cites work: Q5253282
cites work: A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
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: Q4163944
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: Algorithms for the split variational inequality problem
cites work: An iterative row-action method for interval convex programming
cites work: Q3999276
cites work: Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Inertial accelerated algorithms for solving a split feasibility problem
cites work: A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
cites work: Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
cites work: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Q3254057
cites work: A conjugate gradient like method for \(p\)-norm minimization in functional spaces
cites work: Note on the modified relaxation CQ algorithm for the split feasibility problem
cites work: Q4589178
cites work: Q5410428
cites work: Q3322631
cites work: Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
cites work: Q5657633
cites work: Q5471308
cites work: A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
cites work: Q4188284
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: Convergence theorems for inertial KM-type algorithms
cites work: Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
cites work: Q5445188
cites work: Q5542538
cites work: Split monotone variational inclusions
cites work: Solving proximal split feasibility problems without prior knowledge of operator norms
cites work: Convergence of a splitting inertial proximal method for monotone operators
cites work: Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
cites work: Convex functions, monotone operators and differentiability.
cites work: Some methods of speeding up the convergence of iteration methods
cites work: Monotone Operators and the Proximal Point Algorithm
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: Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
cites work: An iterative regularization method for the solution of the split feasibility problem in Banach spaces
cites work: Regularization methods in Banach spaces.
cites work: Nonlinear functional analysis. Fixed point theory and its applications
cites work: A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
cites work: A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
cites work: On the convergence of CQ algorithm with variable steps for the split equality problem
cites work: Inequalities in Banach spaces with applications
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces

A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems (cites work)
cites work: On variable-step relaxed projection algorithm for variational inequalities

A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems (cites work)
cites work: Q3263029

A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems (DOI)
DOI: 10.1007/S11784-019-0684-0