A simple look at the method for solving split feasibility problems in Hilbert spaces

DOI10.1007/S13398-020-00851-1MaRDI QIDQ2175896zbMATH OpenOpenAlexFDO

Authors Rapeepan Kraikaew, Satit Saejung

Publication date 30 April 2020

Published in Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13398-020-00851-1

zbMATH Keywords

Hilbert spacenonexpansive mappingsplit feasibility problem

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Review text

The scope of this note is to provide an alternative, shorter proof of the main result in [\textit{X. Qin} and \textit{L. Wang}, Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat., RACSAM 113, No. 1, 315--325 (2019; Zbl 1440.47053)], where the strong convergence of the iterative sequence generated by a new algorithm towards a fixed point of a nonexpansive mapping that also solves a split feasibility problem in infinite-dimensional Hilbert spaces was proved. At the same time, it is shown that the mentioned result can be achieved under weaker hypotheses.

Recommendations

• A fixed point method for solving a split feasibility problem in Hilbert spaces
• Splitting methods for a convex feasibility problem in Hilbert spaces
• Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• General split feasibility problems in Hilbert spaces

Cites work

• A fixed point method for solving a split feasibility problem in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• A relaxed alternating CQ-algorithm for convex feasibility problems
• An alternating projection that does not converge in norm
• Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
• Fixed points of nonexpanding maps
• scientific article; zbMATH DE number 1194487 (Why is no real title available?)
• scientific article; zbMATH DE number 7416598 (Why is no real title available?)
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• Iterative algorithms for split variational inequalities and generalized split feasibility problems with applications
• Iterative oblique projection onto convex sets and the split feasibility problem
• On split common fixed point problems
• Perturbation resilience and superiorization of iterative algorithms
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Solving linear algebraic equations can be interesting
• Strong convergence for a strongly quasi-nonexpansive sequence in Hilbert spaces
• The multiple-sets split feasibility problem and its applications for inverse problems

Cited in

(6)

• A fixed point method for solving a split feasibility problem in Hilbert spaces
• Global and linear convergence of alternated inertial methods for split feasibility problems
• Splitting methods for a convex feasibility problem in Hilbert spaces
• An inertial self-adaptive algorithm for solving split feasibility problems and fixed point problems in the class of demicontractive mappings
• CQ algorithm with inertial and correction terms for split feasibility problems
• Prediction of Breast Cancer through Fast Optimization Techniques Applied to Machine Learning

This page was built for publication: A simple look at the method for solving split feasibility problems in Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175896)