{"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}
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.