A New Method for Large Scale Nonnegative Least Squares Problems

被引:1
作者
Yong, Longquan [1 ]
机构
[1] Shaanxi Univ Technol, Dept Math, Hanzhong, Peoples R China
来源
PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT, VOL 2 | 2009年
关键词
large scale nonnegative least squares problem; monotone linear complementarity problem; potential-reduction interior point algorithm; polynomial complexity; LINEAR COMPLEMENTARITY-PROBLEMS; CONVERGENCE; ALGORITHM;
D O I
10.1109/ICCTD.2009.88
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:448 / 450
页数:3
相关论文
共 12 条
[1]   Complementarity problems [J].
Billups, SC ;
Murty, KG .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2000, 124 (1-2) :303-318
[2]   The global linear convergence of a noninterior path-following algorithm for linear complementarity problems [J].
Burke, JV ;
Xu, S .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (03) :719-734
[3]  
Cottle R.W., 1992, The Linear Complementarity Problem
[4]  
GEIGER C, 1996, COMPUT OPTIM APPL, V15, P5
[5]   CONVEX PROGRAMMING IN HILBERT SPACE [J].
GOLDSTEIN, AA .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1964, 70 (05) :709-&
[6]   A POLYNOMIAL-TIME ALGORITHM FOR A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS [J].
KOJIMA, M ;
MIZUNO, S ;
YOSHISE, A .
MATHEMATICAL PROGRAMMING, 1989, 44 (01) :1-26
[7]  
Kojima M., 1989, PROGR MATH PROGRAMMI, P29, DOI 10.1007/978-1-4613-9617-8_2
[8]  
Lawson C.L., 1974, SOLVING LEAST SQUARE
[9]  
Levitin Evgeny, 1966, USSR COMP MATH MATH, V6, P1, DOI DOI 10.1016/0041-5553(66)90114-5
[10]  
MEGIDDO N, 1989, PROGR MATH PROGRAMMI, P158