P*(κ)互补问题的宽邻域内点法

Yanli Lv, Mingwang Zhang
{"title":"P*(κ)互补问题的宽邻域内点法","authors":"Yanli Lv, Mingwang Zhang","doi":"10.1109/IWACI.2010.5585175","DOIUrl":null,"url":null,"abstract":"In this paper we propose a new potential reduction interior-point method for a kind of nonlinear nonmonotone complementarity problem—P<inf>*</inf>(κ) complementarity problem, which is based on the wide-neighborhood N<sup>−</sup><inf>∞</inf>(β). This method is a generalization of Mizuno, Todd and Ye's result. Although the search direction of this algorithm is the same as that of the path-following algorithm, the step size is determined as the minimum point of the potential function in the neighborhood. Therefore, the duality gap is reduced by a fixed positive constant at each step. Finally, the polynomial complexity O((2κ + 1 + max{κ, 1 over 4}M)nt)is attained when the problem satisfies a scaled Lipschitz condition, where t is a positive constant and M is defined in the condition.","PeriodicalId":189187,"journal":{"name":"Third International Workshop on Advanced Computational Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A wide-neighborhood interior-point method for P*(κ) complementarity problem\",\"authors\":\"Yanli Lv, Mingwang Zhang\",\"doi\":\"10.1109/IWACI.2010.5585175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a new potential reduction interior-point method for a kind of nonlinear nonmonotone complementarity problem—P<inf>*</inf>(κ) complementarity problem, which is based on the wide-neighborhood N<sup>−</sup><inf>∞</inf>(β). This method is a generalization of Mizuno, Todd and Ye's result. Although the search direction of this algorithm is the same as that of the path-following algorithm, the step size is determined as the minimum point of the potential function in the neighborhood. Therefore, the duality gap is reduced by a fixed positive constant at each step. Finally, the polynomial complexity O((2κ + 1 + max{κ, 1 over 4}M)nt)is attained when the problem satisfies a scaled Lipschitz condition, where t is a positive constant and M is defined in the condition.\",\"PeriodicalId\":189187,\"journal\":{\"name\":\"Third International Workshop on Advanced Computational Intelligence\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Workshop on Advanced Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWACI.2010.5585175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Workshop on Advanced Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWACI.2010.5585175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对一类基于宽邻域N−∞(β)的非线性非单调互补问题p *(κ)互补问题,提出了一种新的势约简内点法。这种方法是对Mizuno, Todd和Ye的结果的推广。虽然该算法的搜索方向与路径跟踪算法相同,但步长确定为邻域内势函数的最小点。因此,对偶间隙在每一步被一个固定的正常数所减小。最后,当问题满足缩放的Lipschitz条件时,得到多项式复杂度O((2κ + 1 + max{κ, 1 / 4}M)nt),其中t为正常数,M在该条件中被定义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A wide-neighborhood interior-point method for P*(κ) complementarity problem
In this paper we propose a new potential reduction interior-point method for a kind of nonlinear nonmonotone complementarity problem—P*(κ) complementarity problem, which is based on the wide-neighborhood N(β). This method is a generalization of Mizuno, Todd and Ye's result. Although the search direction of this algorithm is the same as that of the path-following algorithm, the step size is determined as the minimum point of the potential function in the neighborhood. Therefore, the duality gap is reduced by a fixed positive constant at each step. Finally, the polynomial complexity O((2κ + 1 + max{κ, 1 over 4}M)nt)is attained when the problem satisfies a scaled Lipschitz condition, where t is a positive constant and M is defined in the condition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信