e04ky is an easy-to-use quasi-Newton algorithm for finding a minimum of a function $F\left({x}_{1},{x}_{2},\dots ,{x}_{n}\right)$, subject to fixed upper and lower bounds on the independent variables ${x}_{1},{x}_{2},\dots ,{x}_{n}$, when first derivatives of $F$ are available.
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).

# Syntax

C#
```public static void e04ky(
int n,
int ibound,
E04..::..E04KY_FUNCT2 funct2,
double[] bl,
double[] bu,
double[] x,
out double f,
double[] g,
int[] iw,
double[] w,
out int ifail
)```
Visual Basic
```Public Shared Sub e04ky ( _
n As Integer, _
ibound As Integer, _
funct2 As E04..::..E04KY_FUNCT2, _
bl As Double(), _
bu As Double(), _
x As Double(), _
<OutAttribute> ByRef f As Double, _
g As Double(), _
iw As Integer(), _
w As Double(), _
<OutAttribute> ByRef ifail As Integer _
)```
Visual C++
```public:
static void e04ky(
int n,
int ibound,
E04..::..E04KY_FUNCT2^ funct2,
array<double>^ bl,
array<double>^ bu,
array<double>^ x,
[OutAttribute] double% f,
array<double>^ g,
array<int>^ iw,
array<double>^ w,
[OutAttribute] int% ifail
)```
F#
```static member e04ky :
n : int *
ibound : int *
funct2 : E04..::..E04KY_FUNCT2 *
bl : float[] *
bu : float[] *
x : float[] *
f : float byref *
g : float[] *
iw : int[] *
w : float[] *
ifail : int byref -> unit
```

#### Parameters

n
Type: System..::..Int32
On entry: the number $n$ of independent variables.
Constraint: ${\mathbf{n}}\ge 1$.
ibound
Type: System..::..Int32
On entry: indicates whether the facility for dealing with bounds of special forms is to be used. It must be set to one of the following values:
${\mathbf{ibound}}=0$
If you are supplying all the ${l}_{j}$ and ${u}_{j}$ individually.
${\mathbf{ibound}}=1$
If there are no bounds on any ${x}_{j}$.
${\mathbf{ibound}}=2$
If all the bounds are of the form $0\le {x}_{j}$.
${\mathbf{ibound}}=3$
If ${l}_{1}={l}_{2}=\cdots ={l}_{n}$ and ${u}_{1}={u}_{2}=\cdots ={u}_{n}$.
Constraint: $0\le {\mathbf{ibound}}\le 3$.
funct2
Type: NagLibrary..::..E04..::..E04KY_FUNCT2
You must supply funct2 to calculate the values of the function $F\left(x\right)$ and its first derivative $\frac{\partial F}{\partial {x}_{j}}$ at any point $x$. It should be tested separately before being used in conjunction with e04ky (see the E04 class).

A delegate of type E04KY_FUNCT2.

bl
Type: array<System..::..Double>[]()[][]
An array of size [n]
On entry: the lower bounds ${l}_{j}$.
If ibound is set to $0$, you must set ${\mathbf{bl}}\left[\mathit{j}-1\right]$ to ${l}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$. (If a lower bound is not specified for a particular ${x}_{\mathit{j}}$, the corresponding ${\mathbf{bl}}\left[\mathit{j}-1\right]$ should be set to $-{10}^{6}$.)
If ibound is set to $3$, you must set ${\mathbf{bl}}\left[0\right]$ to ${l}_{1}$; e04ky will then set the remaining elements of bl equal to ${\mathbf{bl}}\left[0\right]$.
On exit: the lower bounds actually used by e04ky.
bu
Type: array<System..::..Double>[]()[][]
An array of size [n]
On entry: the upper bounds ${u}_{j}$.
If ibound is set to $0$, you must set ${\mathbf{bu}}\left[\mathit{j}-1\right]$ to ${u}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$. (If an upper bound is not specified for a particular ${x}_{j}$, the corresponding ${\mathbf{bu}}\left[j-1\right]$ should be set to ${10}^{6}$.)
If ibound is set to $3$, you must set ${\mathbf{bu}}\left[0\right]$ to ${u}_{1}$; e04ky will then set the remaining elements of bu equal to ${\mathbf{bu}}\left[0\right]$.
On exit: the upper bounds actually used by e04ky.
x
Type: array<System..::..Double>[]()[][]
An array of size [n]
On entry: ${\mathbf{x}}\left[\mathit{j}-1\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$. The method checks the gradient at the starting point, and is more likely to detect any error in your programming if the initial ${\mathbf{x}}\left[j-1\right]$ are nonzero and mutually distinct.
On exit: the lowest point found during the calculations. Thus, if ${\mathbf{ifail}}={0}$ on exit, ${\mathbf{x}}\left[j-1\right]$ is the $j$th component of the position of the minimum.
f
Type: System..::..Double%
On exit: the value of $F\left(x\right)$ corresponding to the final point stored in x.
g
Type: array<System..::..Double>[]()[][]
An array of size [n]
On exit: the value of $\frac{\partial F}{\partial {x}_{\mathit{j}}}$ corresponding to the final point stored in x, for $\mathit{j}=1,2,\dots ,n$; the value of ${\mathbf{g}}\left[j-1\right]$ for variables not on a bound should normally be close to zero.
iw
Type: array<System..::..Int32>[]()[][]
An array of size [liw]
On exit: if ${\mathbf{ifail}}={0}$${3}$ or ${5}$, the first n elements of iw contain information about which variables are currently on their bounds and which are free. Specifically, if ${x}_{i}$ is:
 – fixed on its upper bound, ${\mathbf{iw}}\left[i-1\right]$ is $-1$; – fixed on its lower bound, ${\mathbf{iw}}\left[i-1\right]$ is $-2$; – effectively a constant (i.e., ${l}_{j}={u}_{j}$), ${\mathbf{iw}}\left[i-1\right]$ is $-3$; – free, ${\mathbf{iw}}\left[i-1\right]$ gives its position in the sequence of free variables.
In addition, ${\mathbf{iw}}\left[{\mathbf{n}}\right]$ contains the number of free variables (i.e., ${n}_{z}$). The rest of the array is used as workspace.
w
Type: array<System..::..Double>[]()[][]
An array of size [lw]
On exit: if ${\mathbf{ifail}}={0}$${3}$ or ${5}$, ${\mathbf{w}}\left[\mathit{i}-1\right]$ contains the $\mathit{i}$th element of the projected gradient vector ${g}_{z}$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$. In addition, ${\mathbf{w}}\left[{\mathbf{n}}\right]$ contains an estimate of the condition number of the projected Hessian matrix (i.e., $k$). The rest of the array is used as workspace.
ifail
Type: System..::..Int32%
On exit: ${\mathbf{ifail}}={0}$ unless the method detects an error or a warning has been flagged (see [Error Indicators and Warnings]).

# Description

e04ky is applicable to problems of the form:
 $Minimize Fx1,x2,…,xn subject to lj≤xj≤uj, j=1,2,…,n$
when first derivatives are available.
Special provision is made for problems which actually have no bounds on the ${x}_{j}$, problems which have only non-negativity bounds, and problems in which ${l}_{1}={l}_{2}=\dots ={l}_{n}$ and ${u}_{1}={u}_{2}=\dots ={u}_{n}$. You must supply a method to calculate the values of $F\left(x\right)$ and its first derivatives at any point $x$.
From a starting point you supplied there is generated, on the basis of estimates of the curvature of $F\left(x\right)$, a sequence of feasible points which is intended to converge to a local minimum of the constrained function. An attempt is made to verify that the final point is a minimum.
A typical iteration starts at the current point $x$ where ${n}_{z}$ (say) variables are free from both their bounds. The projected gradient vector ${g}_{z}$, whose elements are the derivatives of $F\left(x\right)$ with respect to the free variables, is known. A unit lower triangular matrix $L$ and a diagonal matrix $D$ (both of dimension ${n}_{z}$), such that $LD{L}^{\mathrm{T}}$ is a positive definite approximation of the matrix of second derivatives with respect to the free variables (i.e., the projected Hessian) are also held. The equations
 $LDLTpz=-gz$
are solved to give a search direction ${p}_{z}$, which is expanded to an $n$-vector $p$ by an insertion of appropriate zero elements. Then $\alpha$ is found such that $F\left(x+\alpha p\right)$ is approximately a minimum (subject to the fixed bounds) with respect to $\alpha$; $x$ is replaced by $x+\alpha p$, and the matrices $L$ and $D$ are updated so as to be consistent with the change produced in the gradient by the step $\alpha p$. If any variable actually reaches a bound during the search along $p$, it is fixed and ${n}_{z}$ is reduced for the next iteration.
There are two sets of convergence criteria – a weaker and a stronger. Whenever the weaker criteria are satisfied, the Lagrange multipliers are estimated for all the active constraints. If any Lagrange multiplier estimate is significantly negative, then one of the variables associated with a negative Lagrange multiplier estimate is released from its bound and the next search direction is computed in the extended subspace (i.e., ${n}_{z}$ is increased). Otherwise minimization continues in the current subspace provided that this is practicable. When it is not, or when the stronger convergence criteria are already satisfied, then, if one or more Lagrange multiplier estimates are close to zero, a slight perturbation is made in the values of the corresponding variables in turn until a lower function value is obtained. The normal algorithm is then resumed from the perturbed point.
If a saddle point is suspected, a local search is carried out with a view to moving away from the saddle point. A local search is also performed when a point is found which is thought to be a constrained minimum.

# References

Gill P E and Murray W (1976) Minimization subject to bounds on the variables NPL Report NAC 72 National Physical Laboratory

# Error Indicators and Warnings

Note: e04ky may return useful information for one or more of the following detected errors or warnings.
Errors or warnings detected by the method:
${\mathbf{ifail}}=1$
 On entry, ${\mathbf{n}}<1$, or ${\mathbf{ibound}}<0$, or ${\mathbf{ibound}}>3$, or ${\mathbf{ibound}}=0$ and ${\mathbf{bl}}\left[j-1\right]>{\mathbf{bu}}\left[j-1\right]$ for some $j$, or ${\mathbf{ibound}}=3$ and ${\mathbf{bl}}\left[0\right]>{\mathbf{bu}}\left[0\right]$, or ${\mathbf{liw}}<{\mathbf{n}}+2$, or ${\mathbf{lw}}<\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(11,10×{\mathbf{n}}+{\mathbf{n}}×\left({\mathbf{n}}-1\right)/2\right)$.
${\mathbf{ifail}}=2$
There have been $100×n$ function evaluations, yet the algorithm does not seem to be converging. The calculations can be restarted from the final point held in x. The error may also indicate that $F\left(x\right)$ has no minimum.
${\mathbf{ifail}}=3$
The conditions for a minimum have not all been met but a lower point could not be found and the algorithm has failed.
${\mathbf{ifail}}=4$
An overflow has occurred during the computation. This is an unlikely failure, but if it occurs you should restart at the latest point given in x.
${\mathbf{ifail}}=5$
${\mathbf{ifail}}=6$
${\mathbf{ifail}}=7$
${\mathbf{ifail}}=8$
There is some doubt about whether the point $x$ found by e04ky is a minimum. The degree of confidence in the result decreases as ifail increases. Thus, when ${\mathbf{ifail}}={5}$ it is probable that the final $x$ gives a good estimate of the position of a minimum, but when ${\mathbf{ifail}}={8}$ it is very unlikely that the method has found a minimum.
${\mathbf{ifail}}=9$
In the search for a minimum, the modulus of one of the variables has become very large $\left(\sim {10}^{6}\right)$. This indicates that there is a mistake in funct2, that your problem has no finite solution, or that the problem needs rescaling (see [Further Comments]).
${\mathbf{ifail}}=10$
It is very likely that you have made an error in forming the gradient.
${\mathbf{ifail}}=-9000$
An error occured, see message report.
${\mathbf{ifail}}=-8000$
Negative dimension for array $〈\mathit{\text{value}}〉$
${\mathbf{ifail}}=-6000$
Invalid Parameters $〈\mathit{\text{value}}〉$
If you are dissatisfied with the result (e.g., because ${\mathbf{ifail}}={5}$${6}$${7}$ or ${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. If persistent trouble occurs it may be advisable to try e04kz.

# Accuracy

A successful exit (${\mathbf{ifail}}={0}$) is made from e04ky when (B1, B2 and B3) or B4 hold, and the local search confirms a minimum, where
• $\mathrm{B1}\equiv {\alpha }^{\left(k\right)}×‖{p}^{\left(k\right)}‖<\left({x}_{\mathit{tol}}+\sqrt{\epsilon }\right)×\left(1.0+‖{x}^{\left(k\right)}‖\right)$
• $\mathrm{B2}\equiv \left|{F}^{\left(k\right)}-{F}^{\left(k-1\right)}\right|<\left({x}_{\mathit{tol}}^{2}+\epsilon \right)×\left(1.0+\left|{F}^{\left(k\right)}\right|\right)$
• $\mathrm{B3}\equiv ‖{g}_{z}^{\left(k\right)}‖<\left({\epsilon }^{1/3}+{x}_{\mathit{tol}}\right)×\left(1.0+\left|{F}^{\left(k\right)}\right|\right)$
• $\mathrm{B4}\equiv ‖{g}_{z}^{\left(k\right)}‖<0.01×\sqrt{\epsilon }$.
(Quantities with superscript $k$ are the values at the $k$th iteration of the quantities mentioned in [Description], ${x}_{\mathit{tol}}=100\sqrt{\epsilon }$, $\epsilon$ is the machine precision and $‖.‖$ denotes the Euclidean norm. The vector ${g}_{z}$ is returned in the array w.)
If ${\mathbf{ifail}}={0}$, then the vector in x on exit, ${x}_{\mathrm{sol}}$, is almost certainly an estimate of the position of the minimum, ${x}_{\mathrm{true}}$, to the accuracy specified by ${x}_{\mathit{tol}}$.
If ${\mathbf{ifail}}={3}$ or ${5}$, ${x}_{\mathrm{sol}}$ may still be a good estimate of ${x}_{\mathrm{true}}$, but the following checks should be made. Let $k$ denote an estimate of the condition number of the projected Hessian matrix at ${x}_{\mathrm{sol}}$. (The value of $k$ is returned in ${\mathbf{w}}\left[{\mathbf{n}}\right]$). If
 (i) the sequence $\left\{F\left({x}^{\left(k\right)}\right)\right\}$ converges to $F\left({x}_{\mathrm{sol}}\right)$ at a superlinear or a fast linear rate, (ii) ${‖{g}_{z}\left({x}_{\mathrm{xol}}\right)‖}^{2}<10.0×\epsilon$ and (iii) $k<1.0/‖{g}_{z}\left({x}_{\mathrm{sol}}\right)‖$,
then it is almost certain that ${x}_{\mathrm{sol}}$ is a close approximation to the position of a minimum. When (ii) is true, then usually $F\left({x}_{\mathrm{sol}}\right)$ is a close approximation to $F\left({x}_{\mathrm{true}}\right)$.
When 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 $x$, and about $t-1$ decimals accuracy in $F$, provided the problem is reasonably well scaled.

# Parallelism and Performance

None.

The number of iterations required depends on the number of variables, the behaviour of $F\left(x\right)$ and the distance of the starting point from the solution. The number of operations performed in an iteration of e04ky is roughly proportional to ${n}^{2}$. In addition, each iteration makes at least one call of funct2. So, unless $F\left(x\right)$ and the gradient vector can be evaluated very quickly, the run time will be dominated by the time spent in funct2.
Ideally the problem should be scaled so that at the solution the value of $F\left(x\right)$ and the corresponding values of ${x}_{1},{x}_{2},\dots ,{x}_{n}$ are each in the range $\left(-1,+1\right)$, and so that at points a unit distance away from the solution, $F$ 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 e04ky will take less computer time.

# Example

A program to minimize
 $F=x1+10x22+5⁢x3-x42+x2-2x34+10⁢x1-x44$
subject to
 $-1≤x1≤3,-2≤x2≤0,-1≤x4≤3,$
starting from the initial guess $\left(3,-1,0,1\right)$.

Example program (C#): e04kye.cs

Example program results: e04kye.r