{"title":"单调混合线性互补问题的一种新的多项式内点算法","authors":"Guoqiang Wang, Xinzhong Cai, Y. Yue","doi":"10.1109/ICNC.2008.245","DOIUrl":null,"url":null,"abstract":"In this paper a new polynomial interior-point algorithm for monotone mixed linear complementarity problem is presented. The algorithm is based on a new technique for finding a class of search directions and the strategy of the central path. At each iteration, we use only full-Newton step. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely,O(radic(n log (n\\isin))), which is as good as the linear analogue.","PeriodicalId":6404,"journal":{"name":"2008 Fourth International Conference on Natural Computation","volume":"155 1","pages":"450-454"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem\",\"authors\":\"Guoqiang Wang, Xinzhong Cai, Y. Yue\",\"doi\":\"10.1109/ICNC.2008.245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new polynomial interior-point algorithm for monotone mixed linear complementarity problem is presented. The algorithm is based on a new technique for finding a class of search directions and the strategy of the central path. At each iteration, we use only full-Newton step. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely,O(radic(n log (n\\\\isin))), which is as good as the linear analogue.\",\"PeriodicalId\":6404,\"journal\":{\"name\":\"2008 Fourth International Conference on Natural Computation\",\"volume\":\"155 1\",\"pages\":\"450-454\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2008.245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2008.245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem
In this paper a new polynomial interior-point algorithm for monotone mixed linear complementarity problem is presented. The algorithm is based on a new technique for finding a class of search directions and the strategy of the central path. At each iteration, we use only full-Newton step. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely,O(radic(n log (n\isin))), which is as good as the linear analogue.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
