{"title":"新的平滑加权互补函数和 wLCP 的立方收敛方法","authors":"Tiantian Fan, Jingyong Tang","doi":"10.1007/s11590-024-02139-4","DOIUrl":null,"url":null,"abstract":"<p>The weighted linear complementarity problem (wLCP) can be used for modelling a large class of problems from science and economics. In this paper, we introduce a new class of weighted complementarity functions and show that it is continuously differentiable everywhere. By using this function, we propose a two steps Levenberg–Marquardt-type method to solve the wLCP. Under suitable conditions, we prove that the proposed method is globally convergent and the generated iteration sequence is bounded. Moreover, we show that the proposed method has cubic convergence rate under the local error bound condition. Some numerical results are reported.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"57 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New smooth weighted complementarity functions and a cubically convergent method for wLCP\",\"authors\":\"Tiantian Fan, Jingyong Tang\",\"doi\":\"10.1007/s11590-024-02139-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The weighted linear complementarity problem (wLCP) can be used for modelling a large class of problems from science and economics. In this paper, we introduce a new class of weighted complementarity functions and show that it is continuously differentiable everywhere. By using this function, we propose a two steps Levenberg–Marquardt-type method to solve the wLCP. Under suitable conditions, we prove that the proposed method is globally convergent and the generated iteration sequence is bounded. Moreover, we show that the proposed method has cubic convergence rate under the local error bound condition. Some numerical results are reported.</p>\",\"PeriodicalId\":49720,\"journal\":{\"name\":\"Optimization Letters\",\"volume\":\"57 1\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Letters\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11590-024-02139-4\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Letters","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11590-024-02139-4","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
New smooth weighted complementarity functions and a cubically convergent method for wLCP
The weighted linear complementarity problem (wLCP) can be used for modelling a large class of problems from science and economics. In this paper, we introduce a new class of weighted complementarity functions and show that it is continuously differentiable everywhere. By using this function, we propose a two steps Levenberg–Marquardt-type method to solve the wLCP. Under suitable conditions, we prove that the proposed method is globally convergent and the generated iteration sequence is bounded. Moreover, we show that the proposed method has cubic convergence rate under the local error bound condition. Some numerical results are reported.
期刊介绍:
Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published.
Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field.
Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.