Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
type: Item
instance of: scholarly article
title: Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
author: Nguyen Buong
published in: Numerical Algorithms
publication date: 2017-11-24T00:00:00Z
Mathematics Subject Classification ID: 47J05
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 49J30
zbMATH DE Number: 6812491
zbMATH Keywords: nonexpansive mapping
zbMATH Keywords: fixed point
zbMATH Keywords: variational inequality
MaRDI profile type: Publication
full work available at URL: s11075-017-0282-4
OpenAlex ID: W2593916599
cites work: Properties of Fixed-Point Sets of Nonexpansive Mappings in Banach Spaces
cites work: An explicit iterative algorithm for a class of variational inequalities in Hilbert spaces
cites work: A steepest-descent Krasnosel'skii-Mann algorithm for a class of variational inequalities in Banach spaces
cites work: Q5506948
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: Mann-Type Steepest-Descent and Modified Hybrid Steepest-Descent Methods for Variational Inequalities in Banach Spaces
cites work: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
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: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
cites work: A simpler explicit iterative algorithm for a class of variational inequalities in Hilbert spaces
cites work: Compositions and convex combinations of averaged nonexpansive operators
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
cites work: A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
cites work: Iterative methods for generalized split feasibility problems in Hilbert spaces
cites work: Cyclic algorithms for split feasibility problems in Hilbert spaces
cites work: An iterative approach to quadratic optimization
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
cites work: Averaged mappings and the gradient-projection algorithm
cites work: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
cites work: Implicit and explicit algorithms for solving the split feasibility problem
DOI: 10.1007/S11075-017-0282-4
description: scientific article; zbMATH DE number 6812491