E04 Chapter Contents
E04 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentE04FYF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

E04FYF is an easy-to-use algorithm for finding an unconstrained minimum of a sum of squares of $m$ nonlinear functions in $n$ variables $\left(m\ge n\right)$. No derivatives are required.
It is intended for functions which are continuous and which have continuous first and second derivatives (although it will usually work even if the derivatives have occasional discontinuities).

## 2  Specification

 SUBROUTINE E04FYF ( M, N, LSFUN1, X, FSUMSQ, W, LW, IUSER, RUSER, IFAIL)
 INTEGER M, N, LW, IUSER(*), IFAIL REAL (KIND=nag_wp) X(N), FSUMSQ, W(LW), RUSER(*) EXTERNAL LSFUN1

## 3  Description

E04FYF is essentially identical to the subroutine LSNDN1 in the NPL Algorithms Library. It is applicable to problems of the form
 $MinimizeFx=∑i=1mfix2$
where $x={\left({x}_{1},{x}_{2},\dots ,{x}_{n}\right)}^{\mathrm{T}}$ and $m\ge n$. (The functions ${f}_{i}\left(x\right)$ are often referred to as ‘residuals’.)
You must supply a subroutine to evaluate functions ${f}_{i}\left(x\right)$ at any point $x$.
From a starting point supplied by you, a sequence of points is generated which is intended to converge to a local minimum of the sum of squares. These points are generated using estimates of the curvature of $F\left(x\right)$.
Gill P E and Murray W (1978) Algorithms for the solution of the nonlinear least-squares problem SIAM J. Numer. Anal. 15 977–992

## 5  Parameters

1:     M – INTEGERInput
2:     N – INTEGERInput
On entry: the number $m$ of residuals, ${f}_{i}\left(x\right)$, and the number $n$ of variables, ${x}_{j}$.
Constraint: $1\le {\mathbf{N}}\le {\mathbf{M}}$.
3:     LSFUN1 – SUBROUTINE, supplied by the user.External Procedure
You must supply this routine to calculate the vector of values ${f}_{i}\left(x\right)$ at any point $x$. It should be tested separately before being used in conjunction with E04FYF (see the E04 Chapter Introduction).
The specification of LSFUN1 is:
 SUBROUTINE LSFUN1 ( M, N, XC, FVEC, IUSER, RUSER)
 INTEGER M, N, IUSER(*) REAL (KIND=nag_wp) XC(N), FVEC(M), RUSER(*)
1:     M – INTEGERInput
On entry: $m$, the numbers of residuals.
2:     N – INTEGERInput
On entry: $n$, the numbers of variables.
3:     XC(N) – REAL (KIND=nag_wp) arrayInput
On entry: the point $x$ at which the values of the ${f}_{i}$ are required.
4:     FVEC(M) – REAL (KIND=nag_wp) arrayOutput
On exit: ${\mathbf{FVEC}}\left(\mathit{i}\right)$ must contain the value of ${f}_{\mathit{i}}$ at the point $x$, for $\mathit{i}=1,2,\dots ,m$.
5:     IUSER($*$) – INTEGER arrayUser Workspace
6:     RUSER($*$) – REAL (KIND=nag_wp) arrayUser Workspace
LSFUN1 is called with the parameters IUSER and RUSER as supplied to E04FYF. You are free to use the arrays IUSER and RUSER to supply information to LSFUN1 as an alternative to using COMMON global variables.
LSFUN1 must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which E04FYF is called. Parameters denoted as Input must not be changed by this procedure.
4:     X(N) – REAL (KIND=nag_wp) arrayInput/Output
On entry: ${\mathbf{X}}\left(\mathit{j}\right)$ must be set to a guess at the $\mathit{j}$th component of the position of the minimum, for $\mathit{j}=1,2,\dots ,n$.
On exit: the lowest point found during the calculations. Thus, if ${\mathbf{IFAIL}}={\mathbf{0}}$ on exit, ${\mathbf{X}}\left(j\right)$ is the $j$th component of the position of the minimum.
5:     FSUMSQ – REAL (KIND=nag_wp)Output
On exit: the value of the sum of squares, $F\left(x\right)$, corresponding to the final point stored in X.
6:     W(LW) – REAL (KIND=nag_wp) arrayWorkspace
7:     LW – INTEGERInput
On entry: the dimension of the array W as declared in the (sub)program from which E04FYF is called.
Constraints:
• if ${\mathbf{N}}>1$, ${\mathbf{LW}}\ge 7×{\mathbf{N}}+{\mathbf{N}}×{\mathbf{N}}+2×{\mathbf{M}}×{\mathbf{N}}+3×{\mathbf{M}}+{\mathbf{N}}×\left({\mathbf{N}}-1\right)/2$;
• if ${\mathbf{N}}=1$, ${\mathbf{LW}}\ge 9+5×{\mathbf{M}}$.
8:     IUSER($*$) – INTEGER arrayUser Workspace
9:     RUSER($*$) – REAL (KIND=nag_wp) arrayUser Workspace
IUSER and RUSER are not used by E04FYF, but are passed directly to LSFUN1 and may be used to pass information to this routine as an alternative to using COMMON global variables.
10:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, because for this routine the values of the output parameters may be useful even if ${\mathbf{IFAIL}}\ne {\mathbf{0}}$ on exit, the recommended value is $-1$. When the value $-\mathbf{1}\text{​ or ​}1$ is used it is essential to test the value of IFAIL on exit.
On exit: ${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{1}}$, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Note: E04FYF may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the routine:
${\mathbf{IFAIL}}=1$
 On entry, ${\mathbf{N}}<1$, or ${\mathbf{M}}<{\mathbf{N}}$, or ${\mathbf{LW}}<7×{\mathbf{N}}+{\mathbf{N}}×{\mathbf{N}}+2×{\mathbf{M}}×{\mathbf{N}}+3×{\mathbf{M}}+{\mathbf{N}}×\left({\mathbf{N}}-1\right)/2$, when ${\mathbf{N}}>1$, or ${\mathbf{LW}}<9+5×{\mathbf{M}}$, when ${\mathbf{N}}=1$.
${\mathbf{IFAIL}}=2$
There have been $400×n$ calls of LSFUN1, yet the algorithm does not seem to have converged. This may be due to an awkward function or to a poor starting point, so it is worth restarting E04FYF from the final point held in X.
${\mathbf{IFAIL}}=3$
The final point does not satisfy the conditions for acceptance as a minimum, but no lower point could be found.
${\mathbf{IFAIL}}=4$
An auxiliary routine has been unable to complete a singular value decomposition in a reasonable number of sub-iterations.
${\mathbf{IFAIL}}=5$
${\mathbf{IFAIL}}=6$
${\mathbf{IFAIL}}=7$
${\mathbf{IFAIL}}=8$
There is some doubt about whether the point $x$ found by E04FYF is a minimum of $F\left(x\right)$. The degree of confidence in the result decreases as IFAIL increases. Thus, when ${\mathbf{IFAIL}}={\mathbf{5}}$ it is probable that the final $x$ gives a good estimate of the position of a minimum, but when ${\mathbf{IFAIL}}={\mathbf{8}}$ it is very unlikely that the routine has found a minimum.
If you are not satisfied with the result (e.g., because IFAIL lies between $3$ and $8$), 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. Repeated failure may indicate some defect in the formulation of the problem.

## 7  Accuracy

If the problem is reasonably well scaled and a successful exit is made, then, for a computer with a mantissa of $t$ decimals, one would expect to get about $t/2-1$ decimals accuracy in the components of $x$ and between $t-1$ (if $F\left(x\right)$ is of order $1$ at the minimum) and $2t-2$ (if $F\left(x\right)$ is close to zero at the minimum) decimals accuracy in $F\left(x\right)$.

The number of iterations required depends on the number of variables, the number of residuals and their behaviour, and the distance of the starting point from the solution. The number of multiplications performed per iteration of E04FYF varies, but for $m\gg n$ is approximately $n×{m}^{2}+\mathit{O}\left({n}^{3}\right)$. In addition, each iteration makes at least $n+1$ calls of LSFUN1. So, unless the residuals can be evaluated very quickly, the run time will be dominated by the time spent in LSFUN1.
Ideally, the problem should be scaled so that the minimum value of the sum of squares is in the range $\left(0,+1\right)$, and so that at points a unit distance away from the solution the sum of squares is approximately a unit value greater than at the minimum. 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 E04FYF 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 E04YCF, using information returned in segments of the workspace array W. See E04YCF for further details.

## 9  Example

This example finds least squares estimates of ${x}_{1}$, ${x}_{2}$ and ${x}_{3}$ in the model
 $y=x1+t1x2t2+x3t3$
using the $15$ sets of data given in the following table.
 $y0 t10 t20 t30 0.14 1.0 15.0 1.0 0.18 2.0 14.0 2.0 0.22 3.0 13.0 3.0 0.25 4.0 12.0 4.0 0.29 5.0 11.0 5.0 0.32 6.0 10.0 6.0 0.35 7.0 9.0 7.0 0.39 8.0 8.0 8.0 0.37 9.0 7.0 7.0 0.58 10.0 6.0 6.0 0.73 11.0 5.0 5.0 0.96 12.0 4.0 4.0 1.34 13.0 3.0 3.0 2.10 14.0 2.0 2.0 4.39 15.0 1.0 1.0$
The program uses $\left(0.5,1.0,1.5\right)$ as the initial guess at the position of the minimum.

### 9.1  Program Text

Program Text (e04fyfe.f90)

### 9.2  Program Data

Program Data (e04fyfe.d)

### 9.3  Program Results

Program Results (e04fyfe.r)