节点文献

大规模非负线性最小二乘问题的一个新算法

A new method for large-scale nonnegative linear least squares problems

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 雍龙泉刘三阳张建科周涛

【Author】 YONG Long-quan~(1,2),LIU San-yang~1,ZHANG Jian-ke~3,ZHOU Tao~4 1.Department of Applied Mathematics,Xidian University,Xi’an 710071,China 2.School of Mathematics and Computer Science,Shaanxi University of Technology,Hanzhong 723001, Shaanxi,China 3.School of Science,Xi’an University of Posts and Telecommunications,Xi’an 710121,China 4.School of Science,Ningxia Medical University,Yinchuan 750004,China

【机构】 西安电子科技大学应用数学系陕西理工学院数学与计算机科学学院西安邮电学院理学院宁夏医科大学理学院

【摘要】 研究了求解非负线性最小二乘问题的一个新算法.首先把非负线性最小二乘转化为单调线性互补问题,然后基于牛顿方向和中心路径方向,给出了求解单调线性互补问题的一种势下降内点算法,并证明该算法经过有限次迭代之后收敛到原问题的一个最优解.数值实验表明此方法对求解大规模非负线性最小二乘问题是非常有效的.

【Abstract】 A new method for solving large-scale nonnegative linear least square problems was presented.First, a nonnegative linear least squares problem was transformed into a monotone linear complementarity problem. Then the potential-reduction interior point algorithm was applied to the monotone linear complementarity problem based on the Newton direction and centering direction.We showed that this algorithm stopped at an optimal solution after a finite number of iterations.The numerical results reported here demonstrated a very good computational performance on nonnegative linear least squares problems.

【基金】 国家自然科学基金项目(60974082,81160183);陕西省教育厅科研计划项目(12JK0863,11JK1051)
  • 【文献出处】 兰州大学学报(自然科学版) ,Journal of Lanzhou University(Natural Sciences) , 编辑部邮箱 ,2012年05期
  • 【分类号】O241.5
  • 【被引频次】6
  • 【下载频次】186
节点文献中: 

本文链接的文献网络图示:

本文的引文网络