非线性互补问题的不精确不动点迭代法

IF 0.8 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Algorithms & Computational Technology Pub Date : 2023-01-01 DOI:10.1177/17483026231191264
Xiaobo Song, Xu Zhang, Yuhua Zeng, Zheng Peng
{"title":"非线性互补问题的不精确不动点迭代法","authors":"Xiaobo Song, Xu Zhang, Yuhua Zeng, Zheng Peng","doi":"10.1177/17483026231191264","DOIUrl":null,"url":null,"abstract":"Based on the modulus decomposition, the structured nonlinear complementarity problem is reformulated as an implicit fixed-point system of nonlinear equations. Distinguishing from some existing modulus-based matrix splitting methods, we present a flexible modulus-based inexact fixed-point iteration method for the resulting system, in which the subproblem can be solved approximately by a linear system-solver. The global convergence of the proposed method is established by assuming that the system matrix is positive definite. Some numerical comparisons are reported to illustrate the applicability of the proposed method, especially for large-scale problems.","PeriodicalId":45079,"journal":{"name":"Journal of Algorithms & Computational Technology","volume":"84 1","pages":"0"},"PeriodicalIF":0.8000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Inexact fixed-point iteration method for nonlinear complementarity problems\",\"authors\":\"Xiaobo Song, Xu Zhang, Yuhua Zeng, Zheng Peng\",\"doi\":\"10.1177/17483026231191264\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the modulus decomposition, the structured nonlinear complementarity problem is reformulated as an implicit fixed-point system of nonlinear equations. Distinguishing from some existing modulus-based matrix splitting methods, we present a flexible modulus-based inexact fixed-point iteration method for the resulting system, in which the subproblem can be solved approximately by a linear system-solver. The global convergence of the proposed method is established by assuming that the system matrix is positive definite. Some numerical comparisons are reported to illustrate the applicability of the proposed method, especially for large-scale problems.\",\"PeriodicalId\":45079,\"journal\":{\"name\":\"Journal of Algorithms & Computational Technology\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algorithms & Computational Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1177/17483026231191264\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algorithms & Computational Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1177/17483026231191264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

基于模分解,将结构非线性互补问题重新表述为隐式不动点非线性方程组。区别于现有的基于模的矩阵分裂方法,我们提出了一种基于柔性模的不精确不动点迭代方法,其中子问题可以用线性系统求解器近似求解。在系统矩阵为正定的前提下,证明了该方法的全局收敛性。通过数值比较说明了该方法的适用性,特别是对大规模问题的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Inexact fixed-point iteration method for nonlinear complementarity problems
Based on the modulus decomposition, the structured nonlinear complementarity problem is reformulated as an implicit fixed-point system of nonlinear equations. Distinguishing from some existing modulus-based matrix splitting methods, we present a flexible modulus-based inexact fixed-point iteration method for the resulting system, in which the subproblem can be solved approximately by a linear system-solver. The global convergence of the proposed method is established by assuming that the system matrix is positive definite. Some numerical comparisons are reported to illustrate the applicability of the proposed method, especially for large-scale problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Algorithms & Computational Technology
Journal of Algorithms & Computational Technology COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
1.70
自引率
0.00%
发文量
8
审稿时长
15 weeks
期刊最新文献
Statistical analysis of various splitting criteria for decision trees Inexact fixed-point iteration method for nonlinear complementarity problems Pretrained back propagation based adaptive resonance theory network for adaptive learning Modelling influenza and SARS-CoV-2 interaction: Analysis for Catalonia region DataSifter II: Partially synthetic data sharing of sensitive information containing time-varying correlated observations.
×
引用
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