Explicit iterative algorithms for solving the split equality problems in Hilbert spaces

IF 1.3 4区 数学 Q2 MATHEMATICS, APPLIED
Truong Minh Tuyen, Nguyen Song Ha
{"title":"Explicit iterative algorithms for solving the split equality problems in Hilbert spaces","authors":"Truong Minh Tuyen, Nguyen Song Ha","doi":"10.1007/s11590-024-02144-7","DOIUrl":null,"url":null,"abstract":"<p>We introduce and study some explicit iterative algorithms for solving the system of split equality problems in Hilbert spaces. The strong convergence of the proposed algorithms is proved by using some milder conditions put on control parameters than the one used in Tuyen (Bull Malays Math Sci Soc 46:44, 2023).\n</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"6 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Letters","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11590-024-02144-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We introduce and study some explicit iterative algorithms for solving the system of split equality problems in Hilbert spaces. The strong convergence of the proposed algorithms is proved by using some milder conditions put on control parameters than the one used in Tuyen (Bull Malays Math Sci Soc 46:44, 2023).

Abstract Image

求解希尔伯特空间分割相等问题的显式迭代算法
我们介绍并研究了一些求解希尔伯特空间中分裂相等问题系统的显式迭代算法。通过使用比 Tuyen(Bull Malays Math Sci Soc 46:44, 2023)中使用的控制参数更温和的条件,证明了所提算法的强收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Optimization Letters
Optimization Letters 管理科学-应用数学
CiteScore
3.40
自引率
6.20%
发文量
116
审稿时长
9 months
期刊介绍: Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published. Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field. Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信