NonNegativeLeastSquares Class |
Namespace: Imsl.Math
The NonNegativeLeastSquares type exposes the following members.
Name | Description | |
---|---|---|
NonNegativeLeastSquares |
Construct a new NonNegativeLeastSquares instance to solve
Ax-b where x is a vector of n unknowns.
|
Name | Description | |
---|---|---|
Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) | |
Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
GetDualSolution |
Returns the dual solution vector, w. If then , otherwise
.
| |
GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) | |
GetSolution |
Returns the solution to the problem, x.
| |
GetType | Gets the Type of the current instance. (Inherited from Object.) | |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
SetGuess |
Sets the initial guess.
| |
Solve |
Finds the solution to the problem for the current constraints.
| |
ToString | Returns a string that represents the current object. (Inherited from Object.) |
Name | Description | |
---|---|---|
DualTolerance |
The dual tolerance controlling when the computation stops.
| |
Iterations |
The number of iterations used to find the solution.
| |
MaximumTime |
The maximum time allowed for the solve step.
| |
MaxIterations |
The maximum number of iterations.
| |
NormTolerance |
The residual norm tolerance.
| |
RankTolerance |
The tolerance used for the incoming column rank deficient check.
| |
ResidualNorm |
The euclidean norm of the residual vector, .
|
NonNegativeLeastSquares solves the problem
subject to the condition .If a starting point is provided, those entries of that are are first combined with a descent gradient component. The start point is the origin. When is not provided the algorithm uses only the gradient to verify that an optimum has been found. The algorithm completes using only the gradient components to reach an optimum. For more information, see Lawson and Hanson (1974).