Abstract
Maple procedures for solving the so-called NNLS (Nonnegative Least Squares) problem are described. The NNLS problem is to minimize
subject to
The solution of an NNLS problem is the crucial step of the conventional algorithm for solving linear least-squares problems with linear inequality constraints. Bibliography: 5 titles.
Similar content being viewed by others
REFERENCES
Kh. D. Ikramov and M. Matin far, “Computer-algebra procedures for matrix pseudoinversion,” Zh. Vychisl. Mat. Mat. Fiz., 43, 163–168 (2003).
Kh. D. Ikramov and M. Matin far, “Rank-one modifications and updating pseudoinverse matrices,” Vestn. Mosk. Gos. Univ. Ser. 15 Vychisl. Mat. Kibern., No. 4, 12–17 (2003).
Kh. D. Ikramov and M. Matin far, “Updating the minimum-norm least-squares solution under rank-one modifications of a matrix,” Zh. Vychisl. Mat. Mat. Fiz., 43, 493–505 (2003).
Kh. D. Ikramov and M. Matin far, “On computer-algebra procedures for linear least-squares problems with linear equality constraints,” Zh. Vychisl. Mat. Mat. Fiz., 44, 206–212 (2004).
C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs (1974).
Author information
Authors and Affiliations
Additional information
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 309, 2004, pp. 23–29.
Rights and permissions
About this article
Cite this article
Ikramov, K.D., Matin far, M. Computer-Algebra Implementation of the Least-Squares Method on the Nonnegative Orthant. J Math Sci 132, 156–159 (2006). https://doi.org/10.1007/s10958-005-0485-4
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10958-005-0485-4