Minimize 1/2*x'*c*x + d'*x
subject to x >= 0
.
c ## and d must be real, and c must be symmetric and positive definite.
x0 is an optional initial guess for x.
Outputs:
The minimum attained model value, 1/2*xmin’*c*xmin + d’*xmin
An indicator of convergence. 0 indicates that the iteration count was exceeded, and therefore convergence was not reached; >0 indicates that the algorithm converged. (The algorithm is stable and will converge given enough iterations.)
A structure with two fields:
"algorithm"
: The algorithm used ("nnls"
)
"iterations"
: The number of iterations taken.
Not implemented.
See also: optimset, lsqnonneg, qp.
Package: octave