A Feasible Interior Point Algorithm for a Class of Nonnegative Least Squares Problems

被引:0
作者
Yong, Longquan [1 ]
机构
[1] Shaanxi Univ Technol, Dept Math, Hanzhong, Peoples R China
来源
2009 ETP INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION (FCC 2009) | 2009年
关键词
nonnegative least squares problem; linear complementarity problem; feasible interior point algorithm; polynomial complexity; LINEAR COMPLEMENTARITY-PROBLEMS; CONVERGENCE;
D O I
10.1109/FCC.2009.8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We study a feasible interior-point method for solving a class of nonnegative least squares problems. Firstly, nonnegative least squares problem was transformed into linear complementarity problem. Then we present a feasible interior point algorithm for monotone linear complementarity problem. We show that the algorithm have the polynomial complexity if a feasible starting point is available. At last, we give some numerical examples to indicate that the method is feasible and effective.
引用
收藏
页码:157 / 159
页数:3
相关论文
共 10 条