Non-negative least squares
id:
non-negative-least-squares-181-13400318
title:
Non-negative least squares
text:
In mathematical optimization, the problem of non-negative least squares (NNLS) is a type of constrained least squares problem where the coefficients are not allowed to become negative. That is, given a matrix A and a (column) vector of response variables y, the goal is to find
- a r g m i n x ‖ A x − y ‖ 2 2 subject to x ≥ 0. Here x ≥ 0 means that each component of the vector x should be non-negative, and ‖·‖2 denotes the Euclidean norm. Non-negative least squares problems turn up as subprob
brand slug:
wiki
category slug:
encyclopedia
description:
Constrained least squares problem
original url:
https://en.wikipedia.org/wiki/Non-negative_least_squares
date created:
2014-01-25T14:58:34Z
date modified:
2024-09-06T02:42:28Z
main entity:
{"identifier":"Q17086437","url":"https://www.wikidata.org/entity/Q17086437"}
image:
fields total:
13
integrity:
15