Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_opt_lsq_uncon_mod_func_comp (e04fc)

## Purpose

nag_opt_lsq_uncon_mod_func_comp (e04fc) is a comprehensive algorithm for finding an unconstrained minimum of a sum of squares of m$m$ nonlinear functions in n$n$ variables (mn)$\left(m\ge n\right)$. No derivatives are required.
The function is intended for functions which have continuous first and second derivatives (although it will usually work even if the derivatives have occasional discontinuities).

## Syntax

[x, fsumsq, fvec, fjac, s, v, niter, nf, user, ifail] = e04fc(m, lsqfun, lsqmon, x, 'n', n, 'iprint', iprint, 'maxcal', maxcal, 'eta', eta, 'xtol', xtol, 'stepmx', stepmx, 'user', user)
[x, fsumsq, fvec, fjac, s, v, niter, nf, user, ifail] = nag_opt_lsq_uncon_mod_func_comp(m, lsqfun, lsqmon, x, 'n', n, 'iprint', iprint, 'maxcal', maxcal, 'eta', eta, 'xtol', xtol, 'stepmx', stepmx, 'user', user)
Note: the interface to this routine has changed since earlier releases of the toolbox:
Mark 22: liw, lw have been removed from the interface
Mark 24: maxcal optional, drop w and iw, introduce user in main routine and all call-backs
.

## Description

nag_opt_lsq_uncon_mod_func_comp (e04fc) is essentially identical to the function LSQNDN in the NPL Algorithms Library. It is applicable to problems of the form
 m MinimizeF(x) = ∑ [fi(x)]2 i = 1
$Minimize⁡F(x)=∑i=1m[fi(x)]2$
where x = (x1,x2,,xn)T $x={\left({x}_{1},{x}_{2},\dots ,{x}_{n}\right)}^{\mathrm{T}}$ and mn$m\ge n$. (The functions fi(x)${f}_{i}\left(x\right)$ are often referred to as ‘residuals’.)
You must supply lsqfun to calculate the values of the fi(x)${f}_{i}\left(x\right)$ at any point x$x$.
From a starting point x(1)${x}^{\left(1\right)}$ supplied by you, the function generates a sequence of points x(2),x(3),${x}^{\left(2\right)},{x}^{\left(3\right)},\dots$, which is intended to converge to a local minimum of F(x)$F\left(x\right)$. The sequence of points is given by
 x(k + 1) = x(k) + α(k)p(k) $x (k+1) =x (k) +α(k)p (k)$
where the vector p(k)${p}^{\left(k\right)}$ is a direction of search, and α(k)${\alpha }^{\left(k\right)}$ is chosen such that F(x(k) + α(k)p(k))$F\left({x}^{\left(k\right)}+{\alpha }^{\left(k\right)}{p}^{\left(k\right)}\right)$ is approximately a minimum with respect to α(k)${\alpha }^{\left(k\right)}$.
The vector p(k)${p}^{\left(k\right)}$ used depends upon the reduction in the sum of squares obtained during the last iteration. If the sum of squares was sufficiently reduced, then p(k)${p}^{\left(k\right)}$ is an approximation to the Gauss–Newton direction; otherwise additional function evaluations are made so as to enable p(k)${p}^{\left(k\right)}$ to be a more accurate approximation to the Newton direction.
The method is designed to ensure that steady progress is made whatever the starting point, and to have the rapid ultimate convergence of Newton's method.

## References

Gill P E and Murray W (1978) Algorithms for the solution of the nonlinear least squares problem SIAM J. Numer. Anal. 15 977–992

## Parameters

### Compulsory Input Parameters

1:     m – int64int32nag_int scalar
The number m$m$ of residuals, fi(x)${f}_{i}\left(x\right)$, and the number n$n$ of variables, xj${x}_{j}$.
Constraint: 1nm$1\le {\mathbf{n}}\le {\mathbf{m}}$.
2:     lsqfun – function handle or string containing name of m-file
lsqfun must calculate the vector of values fi(x)${f}_{i}\left(x\right)$ at any point x$x$. (However, if you do not wish to calculate the residuals at a particular x$x$, there is the option of setting a parameter to cause nag_opt_lsq_uncon_mod_func_comp (e04fc) to terminate immediately.)
[iflag, fvec, user] = lsqfun(iflag, m, n, xc, user)

Input Parameters

1:     iflag – int64int32nag_int scalar
Has a non-negative value.
2:     m – int64int32nag_int scalar
m$m$, the numbers of residuals.
3:     n – int64int32nag_int scalar
n$n$, the numbers of variables.
4:     xc(n) – double array
The point x$x$ at which the values of the fi${f}_{i}$ are required.
5:     user – Any MATLAB object
lsqfun is called from nag_opt_lsq_uncon_mod_func_comp (e04fc) with the object supplied to nag_opt_lsq_uncon_mod_func_comp (e04fc).

Output Parameters

1:     iflag – int64int32nag_int scalar
If lsqfun resets iflag to some negative number, nag_opt_lsq_uncon_mod_func_comp (e04fc) will terminate immediately, with ifail set to your setting of iflag.
2:     fvec(m) – double array
Unless iflag is reset to a negative number, fvec(i)${\mathbf{fvec}}\left(\mathit{i}\right)$ must contain the value of fi${f}_{\mathit{i}}$ at the point x$x$, for i = 1,2,,m$\mathit{i}=1,2,\dots ,m$.
3:     user – Any MATLAB object
Note:  lsqfun should be tested separately before being used in conjunction with nag_opt_lsq_uncon_mod_func_comp (e04fc).
3:     lsqmon – function handle or string containing name of m-file
If iprint0${\mathbf{iprint}}\ge 0$, you must supply lsqmon which is suitable for monitoring the minimization process. lsqmon must not change the values of any of its parameters.
If iprint < 0${\mathbf{iprint}}<0$, the string 'e04fdz' can be used as lsqmon.
[user] = lsqmon(m, n, xc, fvec, fjac, ldfjac, s, igrade, niter, nf, user)

Input Parameters

1:     m – int64int32nag_int scalar
m$m$, the numbers of residuals.
2:     n – int64int32nag_int scalar
n$n$, the numbers of variables.
3:     xc(n) – double array
The coordinates of the current point x$x$.
4:     fvec(m) – double array
The values of the residuals fi${f}_{i}$ at the current point x$x$.
5:     fjac(ldfjac,n) – double array
fjac(i,j)${\mathbf{fjac}}\left(\mathit{i},\mathit{j}\right)$ contains the value of (fi)/(xj) $\frac{\partial {f}_{\mathit{i}}}{\partial {x}_{\mathit{j}}}$ at the current point x$x$, for i = 1,2,,m$\mathit{i}=1,2,\dots ,m$ and j = 1,2,,n$\mathit{j}=1,2,\dots ,n$.
6:     ldfjac – int64int32nag_int scalar
The first dimension of the array fjac as declared in the (sub)program from which nag_opt_lsq_uncon_mod_func_comp (e04fc) is called.
7:     s(n) – double array
The singular values of the current approximation to the Jacobian matrix. Thus s may be useful as information about the structure of your problem.
8:     igrade – int64int32nag_int scalar
nag_opt_lsq_uncon_mod_func_comp (e04fc) estimates the dimension of the subspace for which the Jacobian matrix can be used as a valid approximation to the curvature (see Gill and Murray (1978)). This estimate is called the grade of the Jacobian matrix, and igrade gives its current value.
9:     niter – int64int32nag_int scalar
The number of iterations which have been performed in nag_opt_lsq_uncon_mod_func_comp (e04fc).
10:   nf – int64int32nag_int scalar
The number of times that lsqfun has been called so far. (However, for intermediate calls of lsqmon, nf is calculated on the assumption that the latest linear search has been successful. If this is not the case, then the n$n$ evaluations allowed for approximating the Jacobian at the new point will not in fact have been made. nf will be accurate at the final call of lsqmon.)
11:   user – Any MATLAB object
lsqmon is called from nag_opt_lsq_uncon_mod_func_comp (e04fc) with the object supplied to nag_opt_lsq_uncon_mod_func_comp (e04fc).

Output Parameters

1:     user – Any MATLAB object
Note:  you should normally print the sum of squares of residuals, so as to be able to examine the sequence of values of F(x)$F\left(x\right)$ mentioned in Section [Accuracy]. It is usually helpful to print xc, the estimated gradient of the sum of squares, niter and nf.
4:     x(n) – double array
n, the dimension of the array, must satisfy the constraint 1nm$1\le {\mathbf{n}}\le {\mathbf{m}}$.
x(j)${\mathbf{x}}\left(\mathit{j}\right)$ must be set to a guess at the j$\mathit{j}$th component of the position of the minimum, for j = 1,2,,n$\mathit{j}=1,2,\dots ,n$.

### Optional Input Parameters

1:     n – int64int32nag_int scalar
Default: For n, the dimension of the array x.
The number m$m$ of residuals, fi(x)${f}_{i}\left(x\right)$, and the number n$n$ of variables, xj${x}_{j}$.
Constraint: 1nm$1\le {\mathbf{n}}\le {\mathbf{m}}$.
2:     iprint – int64int32nag_int scalar
The frequency with which lsqmon is to be called.
If iprint > 0${\mathbf{iprint}}>0$, lsqmon is called once every iprint iterations and just before exit from nag_opt_lsq_uncon_mod_func_comp (e04fc).
If iprint = 0${\mathbf{iprint}}=0$, lsqmon is just called at the final point.
If iprint < 0${\mathbf{iprint}}<0$, lsqmon is not called at all.
iprint should normally be set to a small positive number.
Default: 1$1$
3:     maxcal – int64int32nag_int scalar
The limit you set on the number of times that lsqfun may be called by nag_opt_lsq_uncon_mod_func_comp (e04fc). There will be an error exit (see Section [Error Indicators and Warnings]) after maxcal calls of lsqfun.
Default: maxcal = 400 × n${\mathbf{maxcal}}=400×n$
Constraint: maxcal1${\mathbf{maxcal}}\ge 1$.
4:     eta – double scalar
Every iteration of nag_opt_lsq_uncon_mod_func_comp (e04fc) involves a linear minimization, i.e., minimization of F(x(k) + α(k)p(k))$F\left({x}^{\left(k\right)}+{\alpha }^{\left(k\right)}{p}^{\left(k\right)}\right)$ with respect to α(k)${\alpha }^{\left(k\right)}$.
Specifies how accurately the linear minimizations are to be performed. The minimum with respect to α(k)${\alpha }^{\left(k\right)}$ will be located more accurately for small values of eta (say, 0.01$0.01$) than for large values (say, 0.9$0.9$). Although accurate linear minimizations will generally reduce the number of iterations performed by nag_opt_lsq_uncon_mod_func_comp (e04fc), they will increase the number of calls of lsqfun made each iteration. On balance it is usually more efficient to perform a low accuracy minimization.
Default:
• if n = 1${\mathbf{n}}=1$, 0.0$0.0$;
• otherwise 0.5$0.5$.
Constraint: 0.0eta < 1.0$0.0\le {\mathbf{eta}}<1.0$.
5:     xtol – double scalar
The accuracy in x$x$ to which the solution is required.
If xtrue${x}_{\mathrm{true}}$ is the true value of x$x$ at the minimum, then xsol${x}_{\mathrm{sol}}$, the estimated position before a normal exit, is such that
 ‖xsol − xtrue‖ < xtol × (1.0 + ‖xtrue‖), $‖xsol-xtrue‖
where y = sqrt(j = 1nyj2)$‖y‖=\sqrt{\sum _{j=1}^{n}{y}_{j}^{2}}$. For example, if the elements of xsol${x}_{\mathrm{sol}}$ are not much larger than 1.0$1.0$ in modulus and if xtol = 1.0e−5${\mathbf{xtol}}=\text{1.0e−5}$, then xsol${x}_{\mathrm{sol}}$ is usually accurate to about five decimal places. (For further details see Section [Accuracy].)
Suggested value: if F(x)$F\left(x\right)$ and the variables are scaled roughly as described in Section [Further Comments] and ε$\epsilon$ is the machine precision, then a setting of order xtol = sqrt(ε)${\mathbf{xtol}}=\sqrt{\epsilon }$ will usually be appropriate. If xtol is set to 0.0$0.0$ or some positive value less than 10ε$10\epsilon$, nag_opt_lsq_uncon_mod_func_comp (e04fc) will use 10ε$10\epsilon$ instead of xtol, since 10ε$10\epsilon$ is probably the smallest reasonable setting.
Default: 0.0$0.0$
Constraint: xtol0.0${\mathbf{xtol}}\ge 0.0$.
6:     stepmx – double scalar
An estimate of the Euclidean distance between the solution and the starting point supplied by you. (For maximum efficiency, a slight overestimate is preferable.) nag_opt_lsq_uncon_mod_func_comp (e04fc) will ensure that, for each iteration,
 n ∑ (xj(k) − xj(k − 1))2 ≤ (stepmx)2, j = 1
$∑j=1n(xj (k) -xj (k-1) )2≤ (stepmx) 2,$
where k$k$ is the iteration number. Thus, if the problem has more than one solution, nag_opt_lsq_uncon_mod_func_comp (e04fc) is most likely to find the one nearest to the starting point. On difficult problems, a realistic choice can prevent the sequence x(k)${x}^{\left(k\right)}$ entering a region where the problem is ill-behaved and can help avoid overflow in the evaluation of F(x)$F\left(x\right)$. However, an underestimate of stepmx can lead to inefficiency.
Default: 100000.0$100000.0$
Constraint: ${\mathbf{stepmx}}\ge {\mathbf{xtol}}$.
7:     user – Any MATLAB object
user is not used by nag_opt_lsq_uncon_mod_func_comp (e04fc), but is passed to lsqfun and lsqmon. Note that for large objects it may be more efficient to use a global variable which is accessible from the m-files than to use user.

### Input Parameters Omitted from the MATLAB Interface

ldfjac ldv iw liw w lw

### Output Parameters

1:     x(n) – double array
The final point x(k)${x}^{\left(k\right)}$. Thus, if ${\mathbf{ifail}}={\mathbf{0}}$ on exit, x(j)${\mathbf{x}}\left(j\right)$ is the j$j$th component of the estimated position of the minimum.
2:     fsumsq – double scalar
The value of F(x)$F\left(x\right)$, the sum of squares of the residuals fi(x)${f}_{i}\left(x\right)$, at the final point given in x.
3:     fvec(m) – double array
The value of the residual fi(x)${f}_{\mathit{i}}\left(x\right)$ at the final point given in x, for i = 1,2,,m$\mathit{i}=1,2,\dots ,m$.
4:     fjac(ldfjac,n) – double array
ldfjacm$\mathit{ldfjac}\ge {\mathbf{m}}$.
The estimate of the first derivative (fi)/(xj) $\frac{\partial {f}_{\mathit{i}}}{\partial {x}_{\mathit{j}}}$ at the final point given in x, for i = 1,2,,m$\mathit{i}=1,2,\dots ,m$ and j = 1,2,,n$\mathit{j}=1,2,\dots ,n$.
5:     s(n) – double array
The singular values of the estimated Jacobian matrix at the final point. Thus s may be useful as information about the structure of your problem.
6:     v(ldv,n) – double array
ldvn$\mathit{ldv}\ge {\mathbf{n}}$.
The matrix V$V$ associated with the singular value decomposition
 J = USVT $J=USVT$
of the estimated Jacobian matrix at the final point, stored by columns. This matrix may be useful for statistical purposes, since it is the matrix of orthonormalized eigenvectors of JTJ${J}^{\mathrm{T}}J$.
7:     niter – int64int32nag_int scalar
The number of iterations which have been performed in nag_opt_lsq_uncon_mod_func_comp (e04fc).
8:     nf – int64int32nag_int scalar
The number of times that the residuals have been evaluated (i.e., number of calls of lsqfun).
9:     user – Any MATLAB object
10:   ifail – int64int32nag_int scalar
${\mathrm{ifail}}={\mathbf{0}}$ unless the function detects an error (see [Error Indicators and Warnings]).

## Error Indicators and Warnings

Note: nag_opt_lsq_uncon_mod_func_comp (e04fc) may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the function:

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

W ifail < 0${\mathbf{ifail}}<0$
A negative value of ifail indicates an exit from nag_opt_lsq_uncon_mod_func_comp (e04fc) because you have set iflag negative in lsqfun. The value of ifail will be the same as your setting of iflag.
ifail = 1${\mathbf{ifail}}=1$
 On entry, n < 1${\mathbf{n}}<1$, or m < n${\mathbf{m}}<{\mathbf{n}}$, or maxcal < 1${\mathbf{maxcal}}<1$, or eta < 0.0${\mathbf{eta}}<0.0$, or eta ≥ 1.0${\mathbf{eta}}\ge 1.0$, or xtol < 0.0${\mathbf{xtol}}<0.0$, or ${\mathbf{stepmx}}<{\mathbf{xtol}}$, or ldfjac < m$\mathit{ldfjac}<{\mathbf{m}}$, or ldv < n$\mathit{ldv}<{\mathbf{n}}$, or liw < 1$\mathit{liw}<1$, or lw < 6 × n + m × n + 2 × m + n × (n − 1) / 2$\mathit{lw}<6×{\mathbf{n}}+{\mathbf{m}}×{\mathbf{n}}+2×{\mathbf{m}}+{\mathbf{n}}×\left({\mathbf{n}}-1\right)/2$, when n > 1${\mathbf{n}}>1$, or lw < 7 + 3 × m$\mathit{lw}<7+3×{\mathbf{m}}$, when n = 1${\mathbf{n}}=1$.
When this exit occurs, no values will have been assigned to fsumsq, or to the elements of fvec, fjac, s or v.
ifail = 2${\mathbf{ifail}}=2$
There have been maxcal calls of lsqfun. If steady reductions in the sum of squares, F(x)$F\left(x\right)$, were monitored up to the point where this exit occurred, then the exit probably occurred simply because maxcal was set too small, so the calculations should be restarted from the final point held in x. This exit may also indicate that F(x)$F\left(x\right)$ has no minimum.
W ifail = 3${\mathbf{ifail}}=3$
The conditions for a minimum have not all been satisfied, but a lower point could not be found. This could be because xtol has been set so small that rounding errors in the evaluation of the residuals make attainment of the convergence conditions impossible.
ifail = 4${\mathbf{ifail}}=4$
The method for computing the singular value decomposition of the estimated Jacobian matrix has failed to converge in a reasonable number of sub-iterations. It may be worth applying nag_opt_lsq_uncon_mod_func_comp (e04fc) again starting with an initial approximation which is not too close to the point at which the failure occurred.
The values ${\mathbf{ifail}}={\mathbf{2}}$, 3${\mathbf{3}}$ or 4${\mathbf{4}}$ may also be caused by mistakes in lsqfun, by the formulation of the problem or by an awkward function. If there are no such mistakes it is worth restarting the calculations from a different starting point (not the point at which the failure occurred) in order to avoid the region which caused the failure.

## Accuracy

A successful exit (${\mathbf{ifail}}={\mathbf{0}}$) is made from nag_opt_lsq_uncon_mod_func_comp (e04fc) when (B1, B2 and B3) or B4 or B5 hold, where
 B1 ≡ α(k) × ‖p(k)‖ < (xtol + ε) × (1.0 + ‖x(k)‖) B2 ≡ |F(k) − F(k − 1)| < (xtol + ε)2 × (1.0 + F(k)) B3 ≡ ‖g(k)‖ < (ε1 / 3 + xtol) × (1.0 + F(k)) B4 ≡ F(k) < ε2 B5 ≡ ‖g(k)‖ < (ε × sqrt(F(k)))1 / 2
$B1 ≡ α (k) ×‖p (k) ‖<(xtol+ε)×(1.0+‖x (k) ‖) B2 ≡ |F (k) -F (k-1) |< (xtol+ε) 2×(1.0+F (k) ) B3 ≡ ‖g (k) ‖<(ε1/3+xtol)×(1.0+F (k) ) B4 ≡ F (k) <ε2 B5 ≡ ‖g (k) ‖<(ε×F (k) ) 1/2$
and where . $‖.‖$ and ε$\epsilon$ are as defined in Section [Parameters], and F(k)${F}^{\left(k\right)}$ and g(k)${g}^{\left(k\right)}$ are the values of F(x)$F\left(x\right)$ and its vector of estimated first derivatives at x(k)${x}^{\left(k\right)}$. If ${\mathbf{ifail}}={\mathbf{0}}$ then the vector in x on exit, xsol${x}_{\mathrm{sol}}$, is almost certainly an estimate of xtrue${x}_{\mathrm{true}}$, the position of the minimum to the accuracy specified by xtol.
If ${\mathbf{ifail}}={\mathbf{3}}$, then xsol${x}_{\mathrm{sol}}$ may still be a good estimate of xtrue${x}_{\mathrm{true}}$, but to verify this you should make the following checks. If
 (a) the sequence {F(x(k))}$\left\{F\left({x}^{\left(k\right)}\right)\right\}$ converges to F(xsol)$F\left({x}_{\mathrm{sol}}\right)$ at a superlinear or a fast linear rate, and (b) g(xsol)T g(xsol) < 10 ε $g{\left({x}_{\mathrm{sol}}\right)}^{\mathrm{T}}g\left({x}_{\mathrm{sol}}\right)<10\epsilon$, where T$\mathrm{T}$ denotes transpose, then it is almost certain that xsol${x}_{\mathrm{sol}}$ is a close approximation to the minimum. When (b) is true, then usually F(xsol)$F\left({x}_{\mathrm{sol}}\right)$ is a close approximation to F(xtrue)$F\left({x}_{\mathrm{true}}\right)$. The values of F(x(k))$F\left({x}^{\left(k\right)}\right)$ can be calculated in lsqmon, and the vector g(xsol)$g\left({x}_{\mathrm{sol}}\right)$ can be calculated from the contents of fvec and fjac on exit from nag_opt_lsq_uncon_mod_func_comp (e04fc).
Further suggestions about confirmation of a computed solution are given in the E04 Chapter Introduction.

The number of iterations required depends on the number of variables, the number of residuals, the behaviour of F(x)$F\left(x\right)$, the accuracy demanded and the distance of the starting point from the solution. The number of multiplications performed per iteration of nag_opt_lsq_uncon_mod_func_comp (e04fc) varies, but for mn$m\gg n$ is approximately n × m2 + O(n3)$n×{m}^{2}+\mathit{O}\left({n}^{3}\right)$. In addition, each iteration makes at least n + 1$n+1$ calls of lsqfun. So, unless the residuals can be evaluated very quickly, the run time will be dominated by the time spent in lsqfun.
Ideally, the problem should be scaled so that, at the solution, F(x)$F\left(x\right)$ and the corresponding values of the xj${x}_{j}$ are each in the range (1, + 1)$\left(-1,+1\right)$, and so that at points one unit away from the solution, F(x)$F\left(x\right)$ differs from its value at the solution by approximately one unit. This will usually imply that the Hessian matrix of F(x)$F\left(x\right)$ at the solution is well-conditioned. It is unlikely that you will be able to follow these recommendations very closely, but it is worth trying (by guesswork), as sensible scaling will reduce the difficulty of the minimization problem, so that nag_opt_lsq_uncon_mod_func_comp (e04fc) will take less computer time.
When the sum of squares represents the goodness-of-fit of a nonlinear model to observed data, elements of the variance-covariance matrix of the estimated regression coefficients can be computed by a subsequent call to nag_opt_lsq_uncon_covariance (e04yc), using information returned in the arrays s and v. See nag_opt_lsq_uncon_covariance (e04yc) for further details.

## Example

```function nag_opt_lsq_uncon_mod_func_comp_example
m  = 15;
n  = 3;
x  = [0.5; 1; 1.5];

y=[0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39];

t = [[1.0, 15.0, 1.0],
[2.0, 14.0, 2.0],
[3.0, 13.0, 3.0],
[4.0, 12.0, 4.0],
[5.0, 11.0, 5.0],
[6.0, 10.0, 6.0],
[7.0, 9.0, 7.0],
[8.0, 8.0, 8.0],
[9.0, 7.0, 7.0],
[10.0, 6.0, 6.0],
[11.0, 5.0, 5.0],
[12.0, 4.0, 4.0],
[13.0, 3.0, 3.0],
[14.0, 2.0, 2.0],
[15.0, 1.0, 1.0]];

user = {y; t};

[xOut, fsumsq, fvec, fjac, s, v, niter, nf, user, ifail] = ...
nag_opt_lsq_uncon_mod_func_comp(int64(m), @lsqfun, @lsqmon, x, 'user', user)

function [iflag,fvecc, user] = lsqfun(iflag, m, n, xc, user)

y = user{1};
t = user{2};

fvecc = zeros(m,1);
for i=1:double(m)
fvecc(i) = xc(1) + t(i,1)/(xc(2)*t(i,2)+xc(3)*t(i,3)) - y(i);
end

function [user] = lsqmon(m, n, xc, fvecc, fjacc, ljc, s, igrade, niter, nf, user)
if (niter == 0)
fprintf('   Itn         F evals        SUMSQ  \n');
end;

fsumsq=dot(fvecc,fvecc);
fprintf('  %3d          %3d        %12.8f\n', niter, nf, fsumsq);
```
```
Itn         F evals        SUMSQ
0            4         10.21037393
1            8          0.19872959
2           12          0.00923238
3           16          0.00821492
4           25          0.00821488
5           30          0.00821488

xOut =

0.0824
1.1330
2.3437

fsumsq =

0.0082

fvec =

-0.0059
-0.0003
0.0003
0.0065
-0.0008
-0.0013
-0.0045
-0.0200
0.0822
-0.0182
-0.0148
-0.0147
-0.0112
-0.0042
0.0068

fjac =

1.0000   -0.0401   -0.0027
1.0000   -0.0663   -0.0095
1.0000   -0.0824   -0.0190
1.0000   -0.0910   -0.0303
1.0000   -0.0941   -0.0428
1.0000   -0.0931   -0.0558
1.0000   -0.0890   -0.0692
1.0000   -0.0827   -0.0827
1.0000   -0.1064   -0.1064
1.0000   -0.1379   -0.1379
1.0000   -0.1820   -0.1820
1.0000   -0.2482   -0.2482
1.0000   -0.3585   -0.3585
1.0000   -0.5791   -0.5791
1.0000   -1.2409   -1.2409

s =

4.0965
1.5950
0.0613

v =

-0.9354    0.3530    0.0214
0.2592    0.6432    0.7205
0.2405    0.6795   -0.6932

niter =

5

nf =

30

user =

[ 1x15 double]
[15x3  double]

ifail =

0

```
```function e04fc_example
m  = 15;
n  = 3;
x  = [0.5; 1; 1.5];

y=[0.14,0.18,0.22,0.25,0.29,0.32,0.35,0.39,0.37,0.58,0.73,0.96,1.34,2.10,4.39];

t = [[1.0, 15.0, 1.0],
[2.0, 14.0, 2.0],
[3.0, 13.0, 3.0],
[4.0, 12.0, 4.0],
[5.0, 11.0, 5.0],
[6.0, 10.0, 6.0],
[7.0, 9.0, 7.0],
[8.0, 8.0, 8.0],
[9.0, 7.0, 7.0],
[10.0, 6.0, 6.0],
[11.0, 5.0, 5.0],
[12.0, 4.0, 4.0],
[13.0, 3.0, 3.0],
[14.0, 2.0, 2.0],
[15.0, 1.0, 1.0]];

user = {y; t};

[xOut, fsumsq, fvec, fjac, s, v, niter, nf, user, ifail] = ...
e04fc(int64(m), @lsqfun, @lsqmon, x, 'user', user)

function [iflag,fvecc, user] = lsqfun(iflag, m, n, xc, user)

y = user{1};
t = user{2};

fvecc = zeros(m,1);
for i=1:double(m)
fvecc(i) = xc(1) + t(i,1)/(xc(2)*t(i,2)+xc(3)*t(i,3)) - y(i);
end

function [user] = lsqmon(m, n, xc, fvecc, fjacc, ljc, s, igrade, niter, nf, user)
if (niter == 0)
fprintf('   Itn         F evals        SUMSQ  \n');
end;

fsumsq=dot(fvecc,fvecc);
fprintf('  %3d          %3d        %12.8f\n', niter, nf, fsumsq);
```
```
Itn         F evals        SUMSQ
0            4         10.21037393
1            8          0.19872959
2           12          0.00923238
3           16          0.00821492
4           25          0.00821488
5           30          0.00821488

xOut =

0.0824
1.1330
2.3437

fsumsq =

0.0082

fvec =

-0.0059
-0.0003
0.0003
0.0065
-0.0008
-0.0013
-0.0045
-0.0200
0.0822
-0.0182
-0.0148
-0.0147
-0.0112
-0.0042
0.0068

fjac =

1.0000   -0.0401   -0.0027
1.0000   -0.0663   -0.0095
1.0000   -0.0824   -0.0190
1.0000   -0.0910   -0.0303
1.0000   -0.0941   -0.0428
1.0000   -0.0931   -0.0558
1.0000   -0.0890   -0.0692
1.0000   -0.0827   -0.0827
1.0000   -0.1064   -0.1064
1.0000   -0.1379   -0.1379
1.0000   -0.1820   -0.1820
1.0000   -0.2482   -0.2482
1.0000   -0.3585   -0.3585
1.0000   -0.5791   -0.5791
1.0000   -1.2409   -1.2409

s =

4.0965
1.5950
0.0613

v =

-0.9354    0.3530    0.0214
0.2592    0.6432    0.7205
0.2405    0.6795   -0.6932

niter =

5

nf =

30

user =

[ 1x15 double]
[15x3  double]

ifail =

0

```

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2013