Iterative approximation of solutions for proximal split feasibility problems
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Geometry and Topology
Link
http://link.springer.com/content/pdf/10.1186/s13663-015-0375-5.pdf
Reference30 articles.
1. Censor, Y, Elfving, T: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8(2-4), 221-239 (1994)
2. Byrne, C: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18(2), 441-453 (2002)
3. Byrne, C: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20(1), 103-120 (2004)
4. Maingé, PE: The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces. Comput. Math. Appl. 59(1), 74-79 (2010)
5. Qu, B, Xiu, N: A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21(5), 1655-1665 (2005)
Cited by 31 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fixed point approach to the stability of a cubic and quartic mixed type functional equation in non-archimedean spaces;Journal of Mathematics and Computer Science;2023-12-05
2. Strong convergence algorithm for proximal split feasibility problem;The Journal of Analysis;2023-07-06
3. Self-adaptive method for solving multiple set split equality variational inequality and fixed point problems in real Hilbert spaces;ANNALI DELL'UNIVERSITA' DI FERRARA;2023-01-10
4. A new self-adaptive inertial CQ-algorithm for solving convex feasibility and monotone inclusion problems;International Journal of Nonlinear Sciences and Numerical Simulation;2022-10-14
5. Convergence Analysis of a Modified Forward-Backward Splitting Algorithm for Minimization and Application to Image Recovery;Computational and Mathematical Methods;2022-10-06
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3