Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
From MaRDI portal
Publication:443134
DOI10.1155/2012/927530zbMath1245.49051OpenAlexW2150710927WikidataQ58906950 ScholiaQ58906950MaRDI QIDQ443134
Yonghong Yao, Giuseppe Marino, Yeong-Cheng Liou, Ru Dong Chen
Publication date: 6 August 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/927530
Related Items (11)
An iterative method for split equality variational inequality problems for non-Lipschitz pseudomonotone mappings ⋮ A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem ⋮ Viscosity iteration methods for a split feasibility problem and a mixed equilibrium problem in a Hilbert space ⋮ Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems ⋮ Solving proximal split feasibility problems without prior knowledge of operator norms ⋮ Iterative approximation for split equality fixed point problem for family of multivalued mappings ⋮ A note on approximating curve with 1-norm regularization method for the split feasibility problem ⋮ A strongly convergent method for the split feasibility problem ⋮ The Split Equality Fixed Point Problem for Quasi-Pseudo-Contractive Mappings Without Prior Knowledge of Norms ⋮ An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings ⋮ Split Feasibility and Fixed Point Problems
Cites Work
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- The relaxed inexact projection methods for the split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- On the unrestricted iteration of projections in Hilbert space
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Incorporation of a priori moment information into signal recovery and synthesis problems
- A computational solution of the inverse problem in radiation-therapy treatment planning
- A multiprojection algorithm using Bregman projections in a product space
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- Integer programming applied to intensity-modulated radiation therapy treatment planning
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A relaxed projection method for variational inequalities
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- Convex programming in Hilbert space
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
