Modified general splitting method for the split feasibility problem

IF 1.8 3区 数学 Q1 Mathematics Journal of Global Optimization Pub Date : 2024-07-10 DOI:10.1007/s10898-024-01399-9
Seakweng Vong, Zhongsheng Yao
{"title":"Modified general splitting method for the split feasibility problem","authors":"Seakweng Vong, Zhongsheng Yao","doi":"10.1007/s10898-024-01399-9","DOIUrl":null,"url":null,"abstract":"<p>Based on the equivalent optimization problems of the splitting feasibility problem, we investigate this problem by using modified general splitting method in this paper. One is a relaxation splitting method with linearization, and the other combines the former with alternated inertial extrapolation step. The strong convergence of our algorithms is analyzed when related parameters are properly chosen. Compared with most existing results where inertial factor must be less than 1, inertial factor can be taken 1 in our alternated inertial-type algorithm. The efficiency of our methods are illustrated by some numerical examples.\n</p>","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":"16 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Global Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10898-024-01399-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

Based on the equivalent optimization problems of the splitting feasibility problem, we investigate this problem by using modified general splitting method in this paper. One is a relaxation splitting method with linearization, and the other combines the former with alternated inertial extrapolation step. The strong convergence of our algorithms is analyzed when related parameters are properly chosen. Compared with most existing results where inertial factor must be less than 1, inertial factor can be taken 1 in our alternated inertial-type algorithm. The efficiency of our methods are illustrated by some numerical examples.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分割可行性问题的修正一般分割法
基于拆分可行性问题的等效优化问题,我们在本文中使用修正的一般拆分方法来研究这一问题。一种是带线性化的松弛分裂法,另一种是将前者与交替惯性外推步骤相结合。在相关参数选择适当的情况下,分析了我们算法的强收敛性。与大多数惯性因子必须小于 1 的现有结果相比,在我们的交替惯性型算法中,惯性因子可以取 1。通过一些数值示例说明了我们方法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Global Optimization
Journal of Global Optimization 数学-应用数学
CiteScore
0.10
自引率
5.60%
发文量
137
审稿时长
6 months
期刊介绍: The Journal of Global Optimization publishes carefully refereed papers that encompass theoretical, computational, and applied aspects of global optimization. While the focus is on original research contributions dealing with the search for global optima of non-convex, multi-extremal problems, the journal’s scope covers optimization in the widest sense, including nonlinear, mixed integer, combinatorial, stochastic, robust, multi-objective optimization, computational geometry, and equilibrium problems. Relevant works on data-driven methods and optimization-based data mining are of special interest. In addition to papers covering theory and algorithms of global optimization, the journal publishes significant papers on numerical experiments, new testbeds, and applications in engineering, management, and the sciences. Applications of particular interest include healthcare, computational biochemistry, energy systems, telecommunications, and finance. Apart from full-length articles, the journal features short communications on both open and solved global optimization problems. It also offers reviews of relevant books and publishes special issues.
期刊最新文献
Smoothing penalty approach for solving second-order cone complementarity problems Aircraft conflict resolution with trajectory recovery using mixed-integer programming Improved approximation algorithms for the k-path partition problem A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization On convergence of a q-random coordinate constrained algorithm for non-convex problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1