NAG Library Manual, Mark 27

Interfaces: FL CL AD

NAG FL Interface Introduction

E04 (Opt) Chapter Contents

E04 (Opt) Chapter Introduction

e04ky: FL CL AD

NAG FL Interface
e04kyf (bounds_quasi_deriv_easy)

Keyword Search:

NAG Library Manual, Mark 27

Interfaces: FL CL AD

NAG FL Interface Introduction

E04 (Opt) Chapter Contents

E04 (Opt) Chapter Introduction

e04ky: FL CL AD

▸▿ Contents

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

8 Parallelism and Performance

9 Further Comments

▸▿ 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

© The Numerical Algorithms Group Ltd. 2019

1 Purpose

e04kyf is an easy-to-use quasi-Newton algorithm for finding a minimum of a function

F (x_{1}, x_{2}, \dots, x_{n})

, 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).

2 Specification

Fortran Interface

Subroutine e04kyf (

n, ibound, funct2, bl, bu, x, f, g, iw, liw, w, lw, iuser, ruser, ifail)

Integer, Intent (In)	::	n, ibound, liw, lw
Integer, Intent (Inout)	::	iuser(*), ifail
Integer, Intent (Out)	::	iw(liw)
Real (Kind=nag_wp), Intent (Inout)	::	bl(n), bu(n), x(n), ruser(*)
Real (Kind=nag_wp), Intent (Out)	::	f, g(n), w(lw)
External	::	funct2

C Header Interface

#include <nag.h>

void

e04kyf_ (const Integer *n, const Integer *ibound,
void (NAG_CALL *funct2)(const Integer *n, const double xc[], double *fc, double gc[], Integer iuser[], double ruser[]),
double bl[], double bu[], double x[], double *f, double g[], Integer iw[], const Integer *liw, double w[], const Integer *lw, Integer iuser[], double ruser[], Integer *ifail)

The routine may be called by the names e04kyf or nagf_opt_bounds_quasi_deriv_easy.

3 Description

e04kyf is applicable to problems of the form:

Minimize F (x_{1}, x_{2}, \dots, x_{n}) subject to l_{j} \leq x_{j} \leq u_{j}, j = 1, 2, \dots, 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 subroutine to calculate the values of

F (x)

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 (x)

, 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 (x)

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

L D L^{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

L D L^{T} p_{z} = - g_{z}

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

α

is found such that

F (x + α p)

is approximately a minimum (subject to the fixed bounds) with respect to

α

;

x

is replaced by

x + α p

, and the matrices

L

and

D

are updated so as to be consistent with the change produced in the gradient by the step

α 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.

4 References

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

5 Arguments

1: $n$ – Integer Input

On entry: the number

n

of independent variables.

Constraint:

n \geq 1

.

2: $ibound$ – Integer Input

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:

$ibound = 0$: If you are supplying all the $l_{j}$ and $u_{j}$ individually.
$ibound = 1$: If there are no bounds on any $x_{j}$ .
$ibound = 2$: If all the bounds are of the form $0 \leq x_{j}$ .
$ibound = 3$: If $l_{1} = l_{2} = \dots = l_{n}$ and $u_{1} = u_{2} = \dots = u_{n}$ .

Constraint:

0 \leq ibound \leq 3

.

3: $funct2$ – Subroutine, supplied by the user. External Procedure

You must supply funct2 to calculate the values of the function

F (x)

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 e04kyf (see the E04 Chapter Introduction).

The specification of funct2 is:

Fortran Interface

Subroutine funct2 (

n, xc, fc, gc, iuser, ruser)

Integer, Intent (In)	::	n
Integer, Intent (Inout)	::	iuser(*)
Real (Kind=nag_wp), Intent (In)	::	xc(n)
Real (Kind=nag_wp), Intent (Inout)	::	ruser(*)
Real (Kind=nag_wp), Intent (Out)	::	fc, gc(n)

C Header Interface

void	funct2_ (const Integer n, const double xc[], double fc, double gc[], Integer iuser[], double ruser[])

1: $n$ – Integer Input: On entry: the number $n$ of variables.
2: $xc (n)$ – Real (Kind=nag_wp) array Input: On entry: the point $x$ at which the function and derivatives are required.
3: $fc$ – Real (Kind=nag_wp) Output: On exit: the value of the function $F$ at the current point $x$ .
4: $gc (n)$ – Real (Kind=nag_wp) array Output: On exit: $gc (j)$ must be set to the value of the first derivative $\frac{\partial F}{\partial x_{j}}$ at the point $x$ , for $j = 1, 2, \dots, n$ .
5: $iuser (*)$ – Integer array User Workspace
6: $ruser (*)$ – Real (Kind=nag_wp) array User Workspace: funct2 is called with the arguments iuser and ruser as supplied to e04kyf. You should use the arrays iuser and ruser to supply information to funct2.

funct2 must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which e04kyf is called. Arguments denoted as Input must not be changed by this procedure.

Note: funct2 should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by e04kyf. If your code inadvertently does return any NaNs or infinities, e04kyf is likely to produce unexpected results.

4: $bl (n)$ – Real (Kind=nag_wp) array Input/Output

On entry: the lower bounds

l_{j}

.

If ibound is set to

0

, you must set

bl (j)

to

l_{j}

, for

j = 1, 2, \dots, n

. (If a lower bound is not specified for a particular

x_{j}

, the corresponding

bl (j)

should be set to

- 10^{6}

.)

If ibound is set to

3

, you must set

bl (1)

to

l_{1}

; e04kyf will then set the remaining elements of bl equal to

bl (1)

.

On exit: the lower bounds actually used by e04kyf.

5: $bu (n)$ – Real (Kind=nag_wp) array Input/Output

On entry: the upper bounds

u_{j}

.

If ibound is set to

0

, you must set

bu (j)

to

u_{j}

, for

j = 1, 2, \dots, n

. (If an upper bound is not specified for a particular

x_{j}

, the corresponding

bu (j)

should be set to

10^{6}

.)

If ibound is set to

3

, you must set

bu (1)

to

u_{1}

; e04kyf will then set the remaining elements of bu equal to

bu (1)

.

On exit: the upper bounds actually used by e04kyf.

6: $x (n)$ – Real (Kind=nag_wp) array Input/Output

On entry:

x (j)

must be set to a guess at the

j

th component of the position of the minimum, for

j = 1, 2, \dots, n

. The routine checks the gradient at the starting point, and is more likely to detect any error in your programming if the initial

x (j)

are nonzero and mutually distinct.

On exit: the lowest point found during the calculations. Thus, if

ifail = 0

on exit,

x (j)

is the

j

th component of the position of the minimum.

7: $f$ – Real (Kind=nag_wp) Output

On exit: the value of

F (x)

corresponding to the final point stored in x.

8: $g (n)$ – Real (Kind=nag_wp) array Output

On exit: the value of

\frac{\partial F}{\partial x_{j}}

corresponding to the final point stored in x, for

j = 1, 2, \dots, n

; the value of

g (j)

for variables not on a bound should normally be close to zero.

9: $iw (liw)$ – Integer array Output

On exit: if

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, $iw (i)$ is $- 1$ ;
–fixed on its lower bound, $iw (i)$ is $- 2$ ;
–effectively a constant (i.e., $l_{j} = u_{j}$ ), $iw (i)$ is $- 3$ ;
–free, $iw (i)$ gives its position in the sequence of free variables.

In addition,

iw (n + 1)

contains the number of free variables (i.e.,

n_{z}

). The rest of the array is used as workspace.

10: $liw$ – Integer Input

On entry: the dimension of the array iw as declared in the (sub)program from which e04kyf is called.

Constraint:

liw \geq n + 2

.

11: $w (lw)$ – Real (Kind=nag_wp) array Output

On exit: if

ifail = 0

,

3

or

5

,

w (i)

contains the

i

th element of the projected gradient vector

g_{z}

, for

i = 1, 2, \dots, n

. In addition,

w (n + 1)

contains an estimate of the condition number of the projected Hessian matrix (i.e.,

k

). The rest of the array is used as workspace.

12: $lw$ – Integer Input

On entry: the dimension of the array w as declared in the (sub)program from which e04kyf is called.

Constraint:

lw \geq \max (10 \times n + n \times (n - 1) / 2, 11)

.

13: $iuser (*)$ – Integer array User Workspace

14: $ruser (*)$ – Real (Kind=nag_wp) array User Workspace

iuser and ruser are not used by e04kyf, but are passed directly to funct2 and may be used to pass information to this routine.

15: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

,

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 4 in the Introduction to the NAG Library FL Interface for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 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 arguments may be useful even if

ifail \neq 0

on exit, the recommended value is

- 1

. When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

or

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

Note: in some cases e04kyf may return useful information.

$ifail = 1$: On entry, $ibound = 〈value〉$ .
Constraint: $0 \leq ibound \leq 3$ .

On entry, $ibound = 0$ and $bl (j) > bu (j)$ for some $j$ .

On entry, $ibound = 3$ and $bl (1) > bu (1)$ .

On entry, $liw = 〈value〉$ .
Constraint: $liw \geq 〈value〉$ .

On entry, $lw = 〈value〉$ .
Constraint: $lw \geq 〈value〉$ .

On entry, $n = 〈value〉$ .
Constraint: $n \geq 1$ .

$ifail = 2$: There have been $100 \times n$ function evaluations.
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 (x)$ has no minimum.

$ifail = 3$: The conditions for a minimum have not all been satisfied, but a lower point could not be found. See Section 7 for further information.

$ifail = 4$: An overflow occurred during computation.
This is an unlikely failure, but if it occurs you should restart at the latest point given in x.

$ifail = 5$: It is probable that a local minimum has been found, but it cannot be guaranteed.

$ifail = 6$: It is possible that a local minimum has been found, but it cannot be guaranteed.

$ifail = 7$: It is unlikely that a local minimum has been found.

$ifail = 8$: It is very unlikely that a local minimum has been found.

$ifail = 9$: The modulus of a variable has become very large. There may be a mistake in funct2, your problem has no finite solution, or the problem needs rescaling.

$ifail = 10$: It is very likely that you have made an error forming the gradient.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

If you are dissatisfied with the result (e.g., because

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 e04kzf.

7 Accuracy

A successful exit (

ifail = 0

) is made from e04kyf when (B1, B2 and B3) or B4 hold, and the local search confirms a minimum, where

$B1 \equiv α^{(k)} \times ‖p^{(k)}‖ < (x_{tol} + \sqrt{ε}) \times (1.0 + ‖x^{(k)}‖)$
$B2 \equiv |F^{(k)} - F^{(k - 1)}| < (x_{tol}^{2} + ε) \times (1.0 + |F^{(k)}|)$
$B3 \equiv ‖g_{z}^{(k)}‖ < (ε^{1 / 3} + x_{tol}) \times (1.0 + |F^{(k)}|)$
$B4 \equiv ‖g_{z}^{(k)}‖ < 0.01 \times \sqrt{ε}$ .

(Quantities with superscript

k

are the values at the

k

th iteration of the quantities mentioned in Section 3,

x_{tol} = 100 \sqrt{ε}

,

ε

is the machine precision and

‖.‖

denotes the Euclidean norm. The vector

g_{z}

is returned in the array w.)

If

ifail = 0

, then the vector in x on exit,

x_{sol}

, is almost certainly an estimate of the position of the minimum,

x_{true}

, to the accuracy specified by

x_{tol}

.

If

ifail = 3

or

5

,

x_{sol}

may still be a good estimate of

x_{true}

, but the following checks should be made. Let

k

denote an estimate of the condition number of the projected Hessian matrix at

x_{sol}

. (The value of

k

is returned in

w (n + 1)

). If

(i)the sequence $\{F (x^{(k)})\}$ converges to $F (x_{sol})$ at a superlinear or a fast linear rate,
(ii) ${‖g_{z} (x_{xol})‖}^{2} < 10.0 \times ε$ and
(iii) $k < 1.0 / ‖g_{z} (x_{sol})‖$ ,

then it is almost certain that

x_{sol}

is a close approximation to the position of a minimum. When (ii) is true, then usually

F (x_{sol})

is a close approximation to

F (x_{true})

.

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.

8 Parallelism and Performance

e04kyf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The number of iterations required depends on the number of variables, the behaviour of

F (x)

and the distance of the starting point from the solution. The number of operations performed in an iteration of e04kyf is roughly proportional to

n^{2}

. In addition, each iteration makes at least one call of funct2. So, unless

F (x)

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 (x)

and the corresponding values of

x_{1}, x_{2}, \dots, x_{n}

are each in the range

(- 1, + 1)

, 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 e04kyf will take less computer time.

10 Example

A program to minimize

F = {(x_{1} + 10 x_{2})}^{2} + 5 {(x_{3} - x_{4})}^{2} + {(x_{2} - 2 x_{3})}^{4} + 10 {(x_{1} - x_{4})}^{4}

subject to

\begin{matrix} 1 \leq x_{1} \leq 3 \\ - 2 \leq x_{2} \leq 0 \\ 1 \leq x_{4} \leq 3, \end{matrix}

starting from the initial guess

(3, - 1, 0, 1)

.

10.1 Program Text

Program Text (e04kyfe.f90)

10.2 Program Data

None.

10.3 Program Results

Program Results (e04kyfe.r)

NAG Library Manual, Mark 27

Interfaces: FL CL AD

NAG FL Interface Introduction

E04 (Opt) Chapter Contents

E04 (Opt) Chapter Introduction

e04ky: FL CL AD

© The Numerical Algorithms Group Ltd. 2019