Next: leasqr, Previous: wls, Up: Residual optimization [Index]
(This function does not fit well into this chapter because it is actually a special case of quadratic programming).
Solve the linear least squares program
min 0.5 sumsq(C*x - d) x
subject to
A*x <= b, Aeq*x = beq, lb <= x <= ub.
The initial guess x0 and the constraint arguments (A and
b, Aeq and beq, lb and ub) can be set to
the empty matrix ([]) if not given. If the initial guess
x0 is feasible the algorithm is faster.
options can be set with optimset, currently the only
option is MaxIter, the maximum number of iterations (default:
200).
Returned values:
Position of minimum.
Scalar value of objective as sumsq(C*x - d).
Vector of solution residuals C*x - d.
Status of solution:
0Maximum number of iterations reached.
-2The problem is infeasible.
-3The problem is not convex and unbounded.
1Global solution found.
Structure with additional information, currently the only field is
iterations, the number of used iterations.
Structure containing Lagrange multipliers corresponding to the constraints.
This function calls the more general function quadprog
internally.
See also: quadprog.
Next: leasqr, Previous: wls, Up: Residual optimization [Index]