Interior-point gradient method for large-scale totally nonnegative least squares problems

Journal of Optimization Theory and Applications

Volumn 126, Issue 1, 2005, Pages 191-202

  Merritt, M ^a   Zhang, Y ^a  

^a Rice University   (United States)

Author keywords

Interior point gradient methods; Totally nonnegative least squares problems

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LEAST SQUARES APPROXIMATIONS; LINEAR PROGRAMMING;

GLOBAL CONVER-GENCE; GRADIENT DIRECTION; GRADIENT'S METHODS; INTERIOR POINT; INTERIOR-POINT GRADIENT METHOD; LARGE-SCALES; NONNEGATIVE LEAST SQUARE PROBLEMS; RESIDUAL NORM; SCALINGS; TOTALLY NONNEGATIVE LEAST-SQUARE PROBLEM;

GRADIENT METHODS;

EID: 23744469721     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-2668-z     Document Type: Article

References (7)

1. LAWSON, C., and HANSON, R., Solving Least-Squares Problems, Chapter 23, Prentice Hall, Englewood Cliffs, New Jersey, 1974.
2. WRIGHT, S., Primal-Dual Interior-Point Methods, SIAM, Philadelphia, Pennsylvania, 1997.
3. GOLDSTEIN, A., Convex Programming in Hilbert Space, Bulletin of the American Mathematical Society, Vol. 70, pp. 709-710, 1964.
4. LEVITIN, E. S., and POLYAK, B. T., Constrained Minimization Methods, USSR Computational Mathematics and Mathematical Physics, Vol. 6, pp. 1-50, 1966.
5. LEE, D. D., and SEUNG, H. S., Algorithms for Nonnegative Matrix Factorization, Advances in Neural Information Processing Systems, Vol. 13, pp. 556-562, 2001.
6. DIKIN, I. I., Iterative Solution of Problems of Linear and Quadratic Programming, Soviet Mathematics Doklady, Vol. 8, pp. 674-675, 1967.
7. ZHANG, Y., Interior-Point Gradient Methods with Diagonal Scalings for Simple-Bound Constrained Optimization, Technical Report TR04-06, Computational and Applied Mathematics Department, Rice University, Houston, Texas, 2004.