New inertial forward–backward algorithm for convex minimization with applications

IF 2.1 3区 数学 Q1 MATHEMATICS Demonstratio Mathematica Pub Date : 2023-01-01 DOI:10.1515/dema-2022-0188
K. Kankam, W. Cholamjiak, P. Cholamjiak
{"title":"New inertial forward–backward algorithm for convex minimization with applications","authors":"K. Kankam, W. Cholamjiak, P. Cholamjiak","doi":"10.1515/dema-2022-0188","DOIUrl":null,"url":null,"abstract":"Abstract In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We then prove the weak convergence theorem and present the numerical experiments for image recovery. The comparative results show that the proposed algorithm has better efficiency than other methods.","PeriodicalId":10995,"journal":{"name":"Demonstratio Mathematica","volume":" ","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Demonstratio Mathematica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/dema-2022-0188","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We then prove the weak convergence theorem and present the numerical experiments for image recovery. The comparative results show that the proposed algorithm has better efficiency than other methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的凸极小化惯性前向-后向算法及其应用
摘要在这项工作中,我们提出了一种新的基于Tseng的外梯度方法和惯性技术的近梯度算法来解决实Hilbert空间中的凸最小化问题。利用步长规则,避免了函数梯度的Lipschitz常数的选取。然后,我们证明了弱收敛定理,并给出了图像恢复的数值实验。比较结果表明,该算法比其他方法具有更好的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.40
自引率
5.00%
发文量
37
审稿时长
35 weeks
期刊介绍: Demonstratio Mathematica publishes original and significant research on topics related to functional analysis and approximation theory. Please note that submissions related to other areas of mathematical research will no longer be accepted by the journal. The potential topics include (but are not limited to): -Approximation theory and iteration methods- Fixed point theory and methods of computing fixed points- Functional, ordinary and partial differential equations- Nonsmooth analysis, variational analysis and convex analysis- Optimization theory, variational inequalities and complementarity problems- For more detailed list of the potential topics please refer to Instruction for Authors. The journal considers submissions of different types of articles. "Research Articles" are focused on fundamental theoretical aspects, as well as on significant applications in science, engineering etc. “Rapid Communications” are intended to present information of exceptional novelty and exciting results of significant interest to the readers. “Review articles” and “Commentaries”, which present the existing literature on the specific topic from new perspectives, are welcome as well.
期刊最新文献
Higher-order circular intuitionistic fuzzy time series forecasting methodology: Application of stock change index A study on a type of degenerate poly-Dedekind sums On the p-fractional Schrödinger-Kirchhoff equations with electromagnetic fields and the Hardy-Littlewood-Sobolev nonlinearity On some geometric results for generalized k-Bessel functions A system of additive functional equations in complex Banach algebras
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1