{"title":"求解大规模非负最小二乘问题的一种新方法","authors":"Longquan Yong","doi":"10.1109/ICCTD.2009.88","DOIUrl":null,"url":null,"abstract":"We present a new method for solving large scale nonnegative least squares problems. Firstly, nonnegative least squares problem was transformed into monotone linear complementarity problem. Then we apply potential-reduction interior point algorithm to monotone linear complementarity problem which is based on the Newton direction and centering direction. We show that this algorithm have the polynomial complexity. Numerical results are reported which demonstrate very good computational performance on nonnegative least squares problems.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A New Method for Large Scale Nonnegative Least Squares Problems\",\"authors\":\"Longquan Yong\",\"doi\":\"10.1109/ICCTD.2009.88\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new method for solving large scale nonnegative least squares problems. Firstly, nonnegative least squares problem was transformed into monotone linear complementarity problem. Then we apply potential-reduction interior point algorithm to monotone linear complementarity problem which is based on the Newton direction and centering direction. We show that this algorithm have the polynomial complexity. Numerical results are reported which demonstrate very good computational performance on nonnegative least squares problems.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Method for Large Scale Nonnegative Least Squares Problems
We present a new method for solving large scale nonnegative least squares problems. Firstly, nonnegative least squares problem was transformed into monotone linear complementarity problem. Then we apply potential-reduction interior point algorithm to monotone linear complementarity problem which is based on the Newton direction and centering direction. We show that this algorithm have the polynomial complexity. Numerical results are reported which demonstrate very good computational performance on nonnegative least squares problems.