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_bounds_quasi_func_easy (e04jy)

## Purpose

nag_opt_bounds_quasi_func_easy (e04jy) 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 of the independent variables ${x}_{1},{x}_{2},\dots ,{x}_{n}$, using function values only.
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

[bl, bu, x, f, iw, w, user, ifail] = e04jy(ibound, funct1, bl, bu, x, 'n', n, 'liw', liw, 'lw', lw, 'user', user)
[bl, bu, x, f, iw, w, user, ifail] = nag_opt_bounds_quasi_func_easy(ibound, funct1, bl, bu, x, 'n', n, 'liw', liw, 'lw', lw, 'user', user)

## Description

nag_opt_bounds_quasi_func_easy (e04jy) is applicable to problems of the form:
 $Minimize Fx1,x2,…,xn subject to lj≤xj≤uj, j=1,2,…,n$
when derivatives of $F\left(x\right)$ are unavailable.
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}=\cdots ={l}_{n}$ and ${u}_{1}={u}_{2}=\cdots ={u}_{n}$. You must supply a function to calculate the value of $F\left(x\right)$ at any point $x$.
From a starting point you supplied there is generated, on the basis of estimates of the gradient and 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 finite difference approximations to 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 estimated 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. Most iterations calculate ${g}_{z}$ using forward differences, but central differences are used when they seem necessary.
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

## Parameters

### Compulsory Input Parameters

1:     $\mathrm{ibound}$int64int32nag_int scalar
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}=\dots ={l}_{n}$ and ${u}_{1}={u}_{2}=\dots ={u}_{n}$.
2:     $\mathrm{funct1}$ – function handle or string containing name of m-file
You must supply funct1 to calculate the value of the function $F\left(x\right)$ at any point $x$. It should be tested separately before being used with nag_opt_bounds_quasi_func_easy (e04jy) (see the E04 Chapter Introduction).
[fc, user] = funct1(n, xc, user)

Input Parameters

1:     $\mathrm{n}$int64int32nag_int scalar
The number $n$ of variables.
2:     $\mathrm{xc}\left({\mathbf{n}}\right)$ – double array
The point $x$ at which the function value is required.
3:     $\mathrm{user}$ – Any MATLAB object
funct1 is called from nag_opt_bounds_quasi_func_easy (e04jy) with the object supplied to nag_opt_bounds_quasi_func_easy (e04jy).

Output Parameters

1:     $\mathrm{fc}$ – double scalar
The value of the function $F$ at the current point $x$.
2:     $\mathrm{user}$ – Any MATLAB object
3:     $\mathrm{bl}\left({\mathbf{n}}\right)$ – double array
The lower bounds ${l}_{j}$.
If ibound is set to $0$, you must set ${\mathbf{bl}}\left(\mathit{j}\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}\right)$ should be set to $-{10}^{6}$.)
If ibound is set to $3$, you must set ${\mathbf{bl}}\left(1\right)$ to ${l}_{1}$; nag_opt_bounds_quasi_func_easy (e04jy) will then set the remaining elements of bl equal to ${\mathbf{bl}}\left(1\right)$.
4:     $\mathrm{bu}\left({\mathbf{n}}\right)$ – double array
The upper bounds ${u}_{j}$.
If ibound is set to $0$, you must set ${\mathbf{bu}}\left(\mathit{j}\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\right)$ should be set to ${10}^{6}$.)
If ibound is set to $3$, you must set ${\mathbf{bu}}\left(1\right)$ to ${u}_{1}$; nag_opt_bounds_quasi_func_easy (e04jy) will then set the remaining elements of bu equal to ${\mathbf{bu}}\left(1\right)$.
5:     $\mathrm{x}\left({\mathbf{n}}\right)$ – double array
${\mathbf{x}}\left(\mathit{j}\right)$ must be set to an estimate of the $\mathit{j}$th component of the position of the minimum, for $\mathit{j}=1,2,\dots ,n$.

### Optional Input Parameters

1:     $\mathrm{n}$int64int32nag_int scalar
Default: the dimension of the arrays bl, bu, x. (An error is raised if these dimensions are not equal.)
The number $n$ of independent variables.
Constraint: ${\mathbf{n}}\ge 1$.
2:     $\mathrm{liw}$int64int32nag_int scalar
Default: ${\mathbf{n}}+2$
The dimension of the array iw.
Constraint: ${\mathbf{liw}}\ge {\mathbf{n}}+2$.
3:     $\mathrm{lw}$int64int32nag_int scalar
Default: $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}}×\left({\mathbf{n}}-1\right)/2+12×{\mathbf{n}},13\right)$
The dimension of the array w.
Constraint: ${\mathbf{lw}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}}×\left({\mathbf{n}}-1\right)/2+12×{\mathbf{n}},13\right)$.
4:     $\mathrm{user}$ – Any MATLAB object
user is not used by nag_opt_bounds_quasi_func_easy (e04jy), but is passed to funct1. 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.

### Output Parameters

1:     $\mathrm{bl}\left({\mathbf{n}}\right)$ – double array
The lower bounds actually used by nag_opt_bounds_quasi_func_easy (e04jy).
2:     $\mathrm{bu}\left({\mathbf{n}}\right)$ – double array
The upper bounds actually used by nag_opt_bounds_quasi_func_easy (e04jy).
3:     $\mathrm{x}\left({\mathbf{n}}\right)$ – double array
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.
4:     $\mathrm{f}$ – double scalar
The value of $F\left(x\right)$ corresponding to the final point stored in x.
5:     $\mathrm{iw}\left({\mathbf{liw}}\right)$int64int32nag_int array
If ${\mathbf{ifail}}={\mathbf{0}}$, ${\mathbf{3}}$ or ${\mathbf{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\right)$ is $-1$; – fixed on its lower bound, ${\mathbf{iw}}\left(i\right)$ is $-2$; – effectively a constant (i.e., ${l}_{j}={u}_{j}$), ${\mathbf{iw}}\left(i\right)$ is $-3$; – free, ${\mathbf{iw}}\left(i\right)$ gives its position in the sequence of free variables.
In addition, ${\mathbf{iw}}\left({\mathbf{n}}+1\right)$ contains the number of free variables (i.e., ${n}_{z}$). The rest of the array is used as workspace.
6:     $\mathrm{w}\left({\mathbf{lw}}\right)$ – double array
If ${\mathbf{ifail}}={\mathbf{0}}$, ${\mathbf{3}}$ or ${\mathbf{5}}$, ${\mathbf{w}}\left(i\right)$ contains a finite difference approximation to 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}}+1\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.
7:     $\mathrm{user}$ – Any MATLAB object
8:     $\mathrm{ifail}$int64int32nag_int scalar
${\mathbf{ifail}}={\mathbf{0}}$ unless the function detects an error (see Error Indicators and Warnings).

## Error Indicators and Warnings

Note: nag_opt_bounds_quasi_func_easy (e04jy) 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.

${\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\right)>{\mathbf{bu}}\left(j\right)$ for some $j$, or ${\mathbf{ibound}}=3$ and ${\mathbf{bl}}\left(1\right)>{\mathbf{bu}}\left(1\right)$, or ${\mathbf{liw}}<{\mathbf{n}}+2$, or ${\mathbf{lw}}<\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(13,12×{\mathbf{n}}+{\mathbf{n}}×\left({\mathbf{n}}-1\right)/2\right)$.
${\mathbf{ifail}}=2$
There have been $400×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.
W  ${\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.
W  ${\mathbf{ifail}}=5$
W  ${\mathbf{ifail}}=6$
W  ${\mathbf{ifail}}=7$
W  ${\mathbf{ifail}}=8$
There is some doubt about whether the point $x$ found by nag_opt_bounds_quasi_func_easy (e04jy) is a minimum. 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 function 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 funct1, that your problem has no finite solution, or that the problem needs rescaling (see Further Comments).
${\mathbf{ifail}}=10$
The computed set of forward-difference intervals (stored in ${\mathbf{w}}\left(9×{\mathbf{n}}+1\right),{\mathbf{w}}\left(9×{\mathbf{n}}+2\right),\dots ,{\mathbf{w}}\left(10×{\mathbf{n}}\right)$) is such that ${\mathbf{x}}\left(i\right)+{\mathbf{w}}\left(9×{\mathbf{n}}+i\right)\le {\mathbf{x}}\left(i\right)$ for some $i$.
This is an unlikely failure, but if it occurs you should attempt to select another starting point.
${\mathbf{ifail}}=-99$
An unexpected error has been triggered by this routine. Please contact NAG.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
If you are dissatisfied with the result (e.g., because ${\mathbf{ifail}}={\mathbf{5}}$, ${\mathbf{6}}$, ${\mathbf{7}}$ or ${\mathbf{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 and the gradient can be calculated, it may be advisable to change to a function which uses gradients (see the E04 Chapter Introduction).

## Accuracy

A successful exit (${\mathbf{ifail}}={\mathbf{0}}$) is made from nag_opt_bounds_quasi_func_easy (e04jy) when ($\mathrm{B1}$, $\mathrm{B2}$ and $\mathrm{B3}$) or $\mathrm{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}}={\mathbf{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}}={\mathbf{3}}$ or ${\mathbf{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}}+1\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.

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 nag_opt_bounds_quasi_func_easy (e04jy) is roughly proportional to ${n}^{2}$. In addition, each iteration makes at least $m+1$ calls of funct1, where $m$ is the number of variables not fixed on bounds. So, unless $F\left(x\right)$ can be evaluated very quickly, the run time will be dominated by the time spent in funct1.
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 nag_opt_bounds_quasi_func_easy (e04jy) will take less computer time.

## Example

To minimize
 $F= x1+10x2 2+5⁢ x3-x4 2+ x2-2x3 4+10⁢ x1-x4 4$
subject to
 $-1≤x1≤ 3, -2≤x2≤ 0, -1≤x4≤ 3,$
starting from the initial guess $\left(3,-1,0,1\right)$.
```function e04jy_example

fprintf('e04jy example results\n\n');

ibound = int64(0);
bl = [1;  -2;  -1000000;  1];
bu = [3;   0;   1000000;  3];
x  = [3;  -1;         0;  1];

% Catch warnings and assume ifail=3,5 gives a good estimate
wstat = warning();
warning('OFF');
[bl, bu, x, f, iw, w, user, ifail] = e04jy(ibound, @funct1, bl, bu, x);
if (ifail == 0 || ifail == 5 | ifail == 3)
fprintf('Minimum found at x: ');
fprintf(' %9.4f',x);
fprintf('\nMinimum value     :  %9.4f\n\n',f);
for i=1:4
fprintf('variable %d is ',i);
if (iw(i)==-1)
fprintf('locked at upper bound\n');
elseif (iw(i)==-2)
fprintf('locked at lower bound\n');
elseif (iw(i)==-3)
fprintf('locked at constant value\n');
else
fprintf('free with index %d\n',iw(i));
end
end
else
fprintf(' Error: e04jy returns ifail = %d\n',ifail);
end
warning(wstat);

function [fc, user] = funct1(n, xc, user)
x1 = xc(1) + 10*xc(2);
x2 = xc(3) -    xc(4);
x3 = xc(2) -  2*xc(3);
x4 = xc(1) -    xc(4);
fc = x1^2 + 5*x2^2 + x3^4 + 10*x4^4;
```
```e04jy example results

Minimum found at x:     1.0000   -0.0852    0.4093    1.0000
Minimum value     :     2.4338

variable 1 is locked at lower bound
variable 2 is free with index 1
variable 3 is free with index 2
variable 4 is locked at lower bound
```

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–2015