Module DBCLSF in IMSLMSolve a nonlinear least squares problem subject to bounds on the variables using a modified Levenberg-Marquardt algorithm and a finite-difference Jacobian.
CALL DBCLSF (FCN, M, N, XGUESS, IBTYPE, XLB, XUB, XSCALE, FSCALE, IPARAM, RPARAM, X, FVEC, FJAC, LDFJAC)| K1b1a1 | Unconstrained nonlinear least squares approximation by smooth functions, user provides no derivatives |
| K1b2a | Linearly constrained nonlinear least squares approximation |