{"title":"一类非负线性最小二乘问题的迭代方法","authors":"Longquan Yong, Fang'an Deng, Shemin Zhang","doi":"10.1109/PIC.2010.5687990","DOIUrl":null,"url":null,"abstract":"An iterative method for solving a class of nonnegative linear least squares problems is presented. Firstly, nonnegative least squares problem is transformed into monotone linear complementarity problem. Then we present an iterative algorithm for monotone linear complementarity problem based on the fixed-point principle. We prove that this method converges to optimal solution of original problem after finite iterations. At last, we give some numerical examples to indicate that the method is feasible and effective.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Iterative method for a class of nonnegative linear least squares problems\",\"authors\":\"Longquan Yong, Fang'an Deng, Shemin Zhang\",\"doi\":\"10.1109/PIC.2010.5687990\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An iterative method for solving a class of nonnegative linear least squares problems is presented. Firstly, nonnegative least squares problem is transformed into monotone linear complementarity problem. Then we present an iterative algorithm for monotone linear complementarity problem based on the fixed-point principle. We prove that this method converges to optimal solution of original problem after finite iterations. At last, we give some numerical examples to indicate that the method is feasible and effective.\",\"PeriodicalId\":142910,\"journal\":{\"name\":\"2010 IEEE International Conference on Progress in Informatics and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Progress in Informatics and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIC.2010.5687990\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Progress in Informatics and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2010.5687990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative method for a class of nonnegative linear least squares problems
An iterative method for solving a class of nonnegative linear least squares problems is presented. Firstly, nonnegative least squares problem is transformed into monotone linear complementarity problem. Then we present an iterative algorithm for monotone linear complementarity problem based on the fixed-point principle. We prove that this method converges to optimal solution of original problem after finite iterations. At last, we give some numerical examples to indicate that the method is feasible and effective.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
