A New Method for Large Scale Nonnegative Least Squares Problems

Longquan Yong
{"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}
引用次数: 3

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解大规模非负最小二乘问题的一种新方法
提出了一种求解大规模非负最小二乘问题的新方法。首先,将非负最小二乘问题转化为单调线性互补问题;然后将降势内点算法应用于基于牛顿方向和定心方向的单调线性互补问题。我们证明了该算法具有多项式复杂度。数值结果表明,非负最小二乘问题具有很好的计算性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research and Application of SOA in B2B Electronic Commerce Butterfly Subdivision Scheme Used for the Unorganized Points Reconstruction in Virtual Environment Notice of RetractionProblems and Countermeasures of Public Sector Human Resource Management In China Innovating IT Education and Accelerating IT Service Outsourcing Talent Training An Efficient Image Compression Technique Using Peak Transform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1