{"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}
引用次数: 0
Abstract
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.