See other catalogues for
The MathWorks
You may also be interested in
Text version of the page
| | | | | | | | | | | | | | |
| | | |
| | | Isqnonneg | | |
| | | |
| | | 0.8405]; [C\d lsqnonneg(C,d>] = - 2.5627 0 3.1108 0.6929 [norm<C*(C\d)-d) norm(C»lsqn< 0.6674 0.9118 | | |
| | | |
| | | The solution from Isqnonneg does not fit as well (has a larger residual), as the least squares solution. However, the nonnegative least squares solution has no negative components. Algorithm Isqnonneg uses the algorithm described in The algorithm starts with a set of possible basis vectors and computes the associated dual vector lambda. It then selects the basis vector corresponding In ihe value in lambda in order to swap out of the basis in exchange lother possible candidate. This continues until lambda <= 0. | | |
| | | |
| | | The arithmetic operator \, optii | | |
| | | |
| | | [1] Lawson, C.L, and R.J. Hanson, So/ring Lens! Squares Problems. Prentice-Hall, 1974, Chapter 23, p. 161. | | |
| | | |
| | | 2-2095 | | |
| | | |
| | | | | | | | | | | | | | |