Abstract
We study an interior-point gradient method for solving a class of so-called totally nonnegative least-squares problems. At each iteration, the method decreases the residual norm along a diagonally-scaled negative gradient direction with a special scaling. We establish the global convergence of the method and present some numerical examples to compare the proposed method with a few similar methods including the affine scaling method.
Similar content being viewed by others
References
C. Lawson R. Hanson (1974) Solving Least-Squares Problems, Chapter 23 Prentice Hall Englewood Cliffs, New Jersey
S. Wright (1997) Primal-Dual Interior-Point Methods SIAM Philadelphia, Pennsylvania
A. Goldstein (1964) ArticleTitleConvex Programming in Hilbert Space Bulletin of the American Mathematical Society. 70 709–710
E.S. Levitin B.T. Polyak (1966) ArticleTitleConstrained Minimization Methods USSR Computational Mathematics and Mathematical Physics. 6 1–50 Occurrence Handle10.1016/0041-5553(66)90114-5
D.D. Lee H.S. Seung (2001) ArticleTitleAlgorithms for Nonnegative Matrix Factorization Advances in Neural Information Processing Systems. 13 556–562
I.I. Dikin (1967) ArticleTitleIterative Solution of Problems of Linear and Quadratic Programming Soviet Mathematics Doklady. 8 674–675
Zhang Y. (2004). 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
Author information
Authors and Affiliations
Additional information
This author was supported in part by DOE/LANL Contract 03891-99-23
This author was supported in part by NSF Grant DMS-0442065
Rights and permissions
About this article
Cite this article
Merritt, M., Zhang, Y. Interior-Point Gradient Method for Large-Scale Totally Nonnegative Least Squares Problems. J Optim Theory Appl 126, 191–202 (2005). https://doi.org/10.1007/s10957-005-2668-z
Issue Date:
DOI: https://doi.org/10.1007/s10957-005-2668-z