Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems

DOI10.1186/1687-1812-2013-333zbMath1336.47058OpenAlexW2134572580WikidataQ59299310 ScholiaQ59299310MaRDI QIDQ402521

Chih-Sheng Chuang, Lai-Jiu Lin, Yew-Dann Chen

Publication date: 28 August 2014

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2013-333

zbMATH Keywords

convex feasibility problemfirmly nonexpansive mappingmultiple sets split feasibility problemmaximum monotoneproximal-contraction

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational and other types of inclusions (47J22)

Related Items (15)

An iterative method for solving split monotone variational inclusion problems and finite family of variational inequality problems in Hilbert spaces ⋮ Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications ⋮ Iterative solution of split variational inclusion problem in a real Banach spaces ⋮ An iterative method for solving split monotone variational inclusion and fixed point problems ⋮ An iterative method for split inclusion problems without prior knowledge of operator norms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inertial-type algorithm for solving split common fixed point problems in Banach spaces ⋮ Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm ⋮ On split inclusion problem and fixed point problem for multi-valued mappings ⋮ Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem ⋮ A method with inertial extrapolation step for split monotone inclusion problems ⋮ Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications ⋮ A new iterative algorithm for split solution problems of quasi-nonexpansive mappings ⋮ Iterative approximation of solution of split variational inclusion problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A contraction proximal point algorithm with two monotone operators
• Inexact Halpern-type proximal point algorithm
• On convergence criteria of generalized proximal point algorithms
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• Convergence of generalized proximal point algorithms
• Approximating solutions of maximal monotone operators in Hilbert spaces
• An alternating projection that does not converge in norm
• On the contraction-proximal point algorithms with multi-parameters
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Monotone Operators and the Proximal Point Algorithm
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• An Iteration Formula for Fredholm Integral Equations of the First Kind

This page was built for publication: Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems