An inertia projection method for nonlinear pseudo-monotone equations with convex constraints

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Numerical Algorithms Pub Date : 2024-09-16 DOI:10.1007/s11075-024-01934-5
Jinkui Liu, Ning Zhang, Bing Tang
{"title":"An inertia projection method for nonlinear pseudo-monotone equations with convex constraints","authors":"Jinkui Liu, Ning Zhang, Bing Tang","doi":"10.1007/s11075-024-01934-5","DOIUrl":null,"url":null,"abstract":"<p>Based on DDP method proposed by Mohammad and Abubakar, in this paper we use the inertia index and relaxation factor to establish an inertia projection method for solving nonlinear pseudo-monotone equations with convex constraints. This method can generate a sufficient descent direction at each iteration, which is independent of any line search condition. Moreover, we prove the global convergence of the proposed method without assuming that the objective function satisfies the Lipschitz continuity. Numerical results demonstrate the effectiveness of the proposed method by comparing with some existing methods.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"21 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01934-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Based on DDP method proposed by Mohammad and Abubakar, in this paper we use the inertia index and relaxation factor to establish an inertia projection method for solving nonlinear pseudo-monotone equations with convex constraints. This method can generate a sufficient descent direction at each iteration, which is independent of any line search condition. Moreover, we prove the global convergence of the proposed method without assuming that the objective function satisfies the Lipschitz continuity. Numerical results demonstrate the effectiveness of the proposed method by comparing with some existing methods.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带凸约束的非线性伪单调方程的惯性投影法
基于 Mohammad 和 Abubakar 提出的 DDP 方法,本文利用惯性指数和松弛因子建立了一种惯性投影法,用于求解带凸约束的非线性伪单调方程。该方法在每次迭代时都能产生一个充分的下降方向,它与任何线搜索条件无关。此外,我们还证明了所提方法的全局收敛性,而无需假设目标函数满足 Lipschitz 连续性。通过与一些现有方法的比较,数值结果证明了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Numerical Algorithms
Numerical Algorithms 数学-应用数学
CiteScore
4.00
自引率
9.50%
发文量
201
审稿时长
9 months
期刊介绍: The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.
期刊最新文献
Numerical solution of nonclassical boundary value problems A posteriori error estimates for the exponential midpoint method for linear and semilinear parabolic equations Communication in multiplex transportation networks Homogeneous multigrid method for hybridizable interior penalty method A note on generalized Floater–Hormann interpolation at arbitrary distributions of nodes
×
引用
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