PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_opt_uncon_conjgrd_comp (e04dg)
Purpose
nag_opt_uncon_conjgrd_comp (e04dg) minimizes an unconstrained nonlinear function of several variables using a pre-conditioned, limited memory quasi-Newton conjugate gradient method. First derivatives (or an ‘acceptable’ finite difference approximation to them) are required. It is intended for use on large scale problems.
Syntax
[
iter,
objf,
objgrd,
x,
user,
lwsav,
iwsav,
rwsav,
ifail] = e04dg(
objfun,
x,
lwsav,
iwsav,
rwsav, 'n',
n, 'user',
user)
[
iter,
objf,
objgrd,
x,
user,
lwsav,
iwsav,
rwsav,
ifail] = nag_opt_uncon_conjgrd_comp(
objfun,
x,
lwsav,
iwsav,
rwsav, 'n',
n, 'user',
user)
Before calling
nag_opt_uncon_conjgrd_comp (e04dg), or
the option setting function
nag_opt_uncon_conjgrd_option_string (e04dk),
function
nag_opt_init (e04wb) must be called.
Description
nag_opt_uncon_conjgrd_comp (e04dg) is designed to solve unconstrained minimization problems of the form
where
is an
-element vector.
You must supply an initial estimate of the solution.
For maximum reliability, it is preferable to provide all first partial derivatives. If all of the derivatives cannot be provided, you are recommended to obtain approximate values (using finite differences) by calling
nag_opt_estimate_deriv (e04xa) from within
objfun.
The method used by
nag_opt_uncon_conjgrd_comp (e04dg) is described in
Algorithmic Details.
References
Gill P E and Murray W (1979) Conjugate-gradient methods for large-scale nonlinear optimization Technical Report SOL 79-15 Department of Operations Research, Stanford University
Gill P E, Murray W and Wright M H (1981) Practical Optimization Academic Press
Parameters
Compulsory Input Parameters
- 1:
– function handle or string containing name of m-file
-
objfun must calculate the objective function
and possibly its gradient as well for a specified
-element vector
.
[mode, objf, objgrd, user] = objfun(mode, n, x, nstate, user)
Input Parameters
- 1:
– int64int32nag_int scalar
-
Indicates which values must be assigned during each call of
objfun. Only the following values need be assigned:
- objf.
- objf and objgrd.
- 2:
– int64int32nag_int scalar
-
, the number of variables.
- 3:
– double array
-
, the vector of variables at which the objective function and its gradient are to be evaluated.
- 4:
– int64int32nag_int scalar
-
Will be
on the first call of
objfun by
nag_opt_uncon_conjgrd_comp (e04dg), and
for all subsequent calls. Thus, you may wish to test,
nstate within
objfun in order to perform certain calculations once only. For example, you may read data or initialize global variables when
.
- 5:
– Any MATLAB object
objfun is called from
nag_opt_uncon_conjgrd_comp (e04dg) with the object supplied to
nag_opt_uncon_conjgrd_comp (e04dg).
Output Parameters
- 1:
– int64int32nag_int scalar
-
May be set to a negative value if you wish to terminate the solution to the current problem, and in this case
nag_opt_uncon_conjgrd_comp (e04dg) will terminate with
ifail set to
mode.
- 2:
– double scalar
-
The value of the objective function at .
- 3:
– double array
-
If ,
must contain the value of evaluated at , for .
- 4:
– Any MATLAB object
Note: objfun should be tested separately before being used in conjunction with
nag_opt_uncon_conjgrd_comp (e04dg). See also the description of the optional parameter
Verify.
- 2:
– double array
-
An initial estimate of the solution.
- 3:
– logical array
- 4:
– int64int32nag_int array
- 5:
– double array
-
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the dimension of the array
x.
, the number of variables.
Constraint:
.
- 2:
– Any MATLAB object
user is not used by
nag_opt_uncon_conjgrd_comp (e04dg), but is passed to
objfun. 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:
– int64int32nag_int scalar
-
The total number of iterations performed.
- 2:
– double scalar
-
The value of the objective function at the final iterate.
- 3:
– double array
-
The gradient of the objective function at the final iterate (or its finite difference approximation).
- 4:
– double array
-
The final estimate of the solution.
- 5:
– Any MATLAB object
- 6:
– logical array
- 7:
– int64int32nag_int array
- 8:
– double array
-
- 9:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
nag_opt_uncon_conjgrd_comp (e04dg) returns with
if the following three conditions are satisfied:
(i) |
|
(ii) |
|
(iii) |
or |
where
is the value of the optional parameter
Optimality Tolerance (
) and
is the absolute error associated with computing the objective function.
For a full discussion on termination criteria see Chapter 8 of
Gill et al. (1981).
Error Indicators and Warnings
Note: nag_opt_uncon_conjgrd_comp (e04dg) 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
-
A negative value of
ifail indicates an exit from
nag_opt_uncon_conjgrd_comp (e04dg) because you set
in
objfun. The value of
ifail will be the same as your setting of
mode.
-
Not used by this function.
-
Not used by this function.
-
-
The limiting number of iterations (as determined by the optional parameter
Iteration Limit (
) has been reached.
If the algorithm appears to be making satisfactory progress, then optional parameter
Iteration Limit may be too small. If so, increase its value and rerun
nag_opt_uncon_conjgrd_comp (e04dg). If the algorithm seems to be making little or no progress, then you should check for incorrect gradients as described under
.
-
-
The computed upper bound on the step length taken during the linesearch was too small. A rerun with an increased value of the optional parameter
Maximum Step Length (
say) may be successful unless
(the default value), in which case the current point cannot be improved upon.
-
Not used by this function.
- W
-
The conditions for an acceptable solution (see argument
ifail in
Arguments) have not all been met, but a lower point could not be found.
If
objfun computes the objective function and its gradient correctly, then this may occur because an overly stringent accuracy has been requested, i.e., the value of the optional parameter
Optimality Tolerance (
) is too small or if
. In this case you should apply the three tests described under
to determine whether or not the final solution is acceptable. For a discussion of attainable accuracy see
Gill et al. (1981).
If many iterations have occurred in which essentially no progress has been made or
nag_opt_uncon_conjgrd_comp (e04dg) has failed to move from the initial point,
objfun may be incorrect. You should refer to the comments below under
and check the gradients using the optional parameter
Verify (
). Unfortunately, there may be small errors in the objective gradients that cannot be detected by the verification process. Finite difference approximations to first derivatives are catastrophically affected by even small inaccuracies.
- W
-
The user-supplied derivatives of the objective function appear to be incorrect.
Large errors were found in the derivatives of the objective function. This value of
ifail will occur if the verification process indicated that at least one gradient element had no correct figures. You should refer to the printed output to determine which elements are suspected to be in error.
As a first step, you should check that the code for the objective values is correct – for example, by computing the function at a point where the correct value is known. However, care should be taken that the chosen point fully tests the evaluation of the function. It is remarkable how often the values or are used to test function evaluation procedures, and how often the special properties of these numbers make the test meaningless.
Special care should be used in this test if computation of the objective function involves subsidiary data communicated in global storage. Although the first evaluation of the function may be correct, subsequent calculations may be in error because some of the subsidiary data has accidentally been overwritten.
Errors in programming the function may be quite subtle in that the function value is almost correct. For example, the function may not be accurate to full precision because of the inaccurate calculation of a subsidiary quantity, or the limited accuracy of data upon which the function depends. A common error on machines where numerical calculations are usually performed in double precision is to include even one single precision constant in the calculation of the function; since some compilers do not convert such constants to double precision, half the correct figures may be lost by such a seemingly trivial error.
-
-
The gradient
at the starting point
is ‘too small’. More precisely, the value of
is less than
, where
is the value of the optional parameter
Function Precision (
).
The problem should be rerun from a different starting point.
-
-
An input argument is invalid.
-
An unexpected error has been triggered by this routine. Please
contact
NAG.
-
Your licence key may have expired or may not have been installed correctly.
-
Dynamic memory allocation failed.
Accuracy
On successful exit (
) the accuracy of the solution will be as defined by the optional parameter
Optimality Tolerance (
).
Further Comments
To evaluate an ‘acceptable’ set of finite difference intervals using
nag_opt_estimate_deriv (e04xa) requires
function evaluations per variable for a well-scaled problem and up to
function evaluations per variable for a badly scaled problem.
Description of Printed Output
This section describes the intermediate printout and final printout produced by
nag_opt_uncon_conjgrd_comp (e04dg). You can control the level of printed output (see the description of the optional parameter
Print Level). Note that the intermediate printout and final printout are produced only if
(the default
).
The following line of summary output (
characters) is produced at every iteration. In all cases, the values of the quantities are those in effect
on completion of the given iteration.
Itn |
is the iteration count.
|
Step |
is the step taken along the computed search direction. On reasonably well-behaved problems, the unit step (i.e., ) will be taken as the solution is approached.
|
Nfun |
is the cumulated number of evaluations of the objective function needed for the linesearch. Evaluations needed for the verification of the gradients by finite differences are not included. Nfun is printed as a guide to the amount of work required for the linesearch. nag_opt_uncon_conjgrd_comp (e04dg) will perform at most function evaluations per iteration.
|
Objective |
is the value of the objective function at .
|
Norm G |
is the Euclidean norm of the gradient of the objective function at .
|
Norm X |
is the Euclidean norm of .
|
Norm (X(k-1)-X(k)) |
is the Euclidean norm of .
|
The following describes the printout for each variable.
Variable |
gives the name (Varbl) and index , for of the variable.
|
Value |
is the value of the variable at the final iteration.
|
Gradient Value |
is the value of the gradient of the objective function with respect to the th variable at the final iteration.
|
Numerical values are output with a fixed number of digits; they are not guaranteed to be accurate to this precision.
Example
This example finds a minimum of the function
The initial point is
and
(to five figures).
The optimal solution is
and
.
Open in the MATLAB editor:
e04dg_example
function e04dg_example
fprintf('e04dg example results\n\n');
x = [-1 1];
[cwsav,lwsav,iwsav,rwsav,ifail] = e04wb( ...
'e04dg');
[iter, objf, objgrd, x, user, lwsav, iwsav, rwsav, ifail] = ...
e04dg( ...
@objfun, x, lwsav, iwsav, rwsav);
fprintf('Variable Value Gradient value\n');
for i=1:2
fprintf('Varbl %3d %12.8f %9.1e\n', i, x(i), objgrd(i));
end
fprintf('\nFinal objective value = %15.7e\n',objf);
function [mode, objf, objgrd, user] = objfun(mode, n, x, nstate, user)
expx1 = exp(x(1));
objf = expx1*(4*x(1)^2+2*x(2)^2+4*x(1)*x(2)+2*x(2)+1);
if (mode == 2)
objgrd(1) = 4*expx1*(2*x(1)+x(2)) + objf;
objgrd(2) = 2*expx1*(2*x(2)+2*x(1)+1);
else
objgrd = zeros(2,1);
end
e04dg example results
Variable Value Gradient value
Varbl 1 0.50000001 9.1e-07
Varbl 2 -0.99999989 8.3e-07
Final objective value = 5.3083002e-14
Note: the remainder of this document is intended for more advanced users. Algorithmic Details contains a detailed description of the algorithm which may be needed in order to understand Optional Parameters. Optional Parameters describes the optional parameters which may be set by calls to nag_opt_uncon_conjgrd_option_string (e04dk).
Algorithmic Details
This section contains a description of the method used by nag_opt_uncon_conjgrd_comp (e04dg).
nag_opt_uncon_conjgrd_comp (e04dg) uses a pre-conditioned conjugate gradient method and is based upon algorithm PLMA as described in Section 4.8.3 of
Gill and Murray (1979) and
Gill et al. (1981).
The algorithm proceeds as follows:
Let
be a given starting point and let
denote the current iteration, starting with
. The iteration requires
, the gradient vector evaluated at
, the
th estimate of the minimum. At each iteration a vector
(known as the direction of search) is computed and the new estimate
is given by
where
(the step length) minimizes the function
with respect to the scalar
. A choice of initial step
is taken as
where
is a user-supplied estimate of the function value at the solution. If
is not specified, the software always chooses the unit step length for
. Subsequent step length estimates are computed using cubic interpolation with safeguards.
A quasi-Newton method can be used to compute the search direction
by updating the inverse of the approximate Hessian
and computing
The updating formula for the approximate inverse is given by
where
and
.
The method used to obtain the search direction is based upon computing
as
where
is a matrix obtained by updating the identity matrix with a limited number of quasi-Newton corrections. The storage of an
by
matrix is avoided by storing only the vectors that define the rank two corrections – hence the term ‘limited-memory’ quasi-Newton method. The precise method depends upon the number of updating vectors stored. For example, the direction obtained with the ‘one-step’ limited memory update is given by
(1) using
(2) with
equal to the identity matrix, viz.
Using a limited-memory quasi-Newton formula, such as the one above, guarantees
to be a descent direction if all the inner products
are positive for all vectors
and
used in the updating formula.
Optional Parameters
Several optional parameters in nag_opt_uncon_conjgrd_comp (e04dg) define choices in the problem specification or the algorithm logic. In order to reduce the number of formal arguments of nag_opt_uncon_conjgrd_comp (e04dg) these optional parameters have associated default values that are appropriate for most problems. Therefore, you need only specify those optional parameters whose values are to be different from their default values.
The remainder of this section can be skipped if you wish to use the default values for all optional parameters.
The following is a list of the optional parameters available. A full description of each optional parameter is provided in
Description of the s.
Optional parameters may be specified by calling
nag_opt_uncon_conjgrd_option_string (e04dk) before a call to
nag_opt_uncon_conjgrd_comp (e04dg).
nag_opt_uncon_conjgrd_option_string (e04dk) can be called to supply options directly, one call being necessary for each optional parameter. For example,
[lwsav, iwsav, rwsav, inform] = e04dk('Print Level = 1', lwsav, iwsav, rwsav);
nag_opt_uncon_conjgrd_option_string (e04dk) should be consulted for a full description of this method of supplying optional parameters.
All optional parameters not specified by you are set to their default values. Optional parameters specified by you are unaltered by nag_opt_uncon_conjgrd_comp (e04dg) (unless they define invalid values) and so remain in effect for subsequent calls unless altered by you.
Description of the Optional Parameters
For each option, we give a summary line, a description of the optional parameter and details of constraints.
The summary line contains:
- the keywords, where the minimum abbreviation of each keyword is underlined (if no characters of an optional qualifier are underlined, the qualifier may be omitted);
- a parameter value,
where the letters , and denote options that take character, integer and real values respectively;
- the default value, where the symbol is a generic notation for machine precision (see nag_machine_precision (x02aj)), and denotes the relative precision of the objective function Function Precision.
Keywords and character values are case and white space insensitive.
Defaults
This special keyword may be used to reset all optional parameters to their default values.
Estimated Optimal Function Value
This value of
specifies the user-supplied guess of the optimum objective function value
. This value is used to calculate an initial step length
(see
Algorithmic Details). If the value of
is not specified (the default), then this has the effect of setting
to unity. It should be noted that for badly scaled functions a unit step along the steepest descent direction will often compute the objective function at very large values of
.
Function Precision Default
The parameter defines , which is intended to be a measure of the accuracy with which the problem function can be computed. If or , the default value is used.
The value of
should reflect the relative precision of
; i.e.,
acts as a relative precision when
is large, and as an absolute precision when
is small. For example, if
is typically of order
and the first six significant digits are known to be correct, an appropriate value for
would be
. In contrast, if
is typically of order
and the first six significant digits are known to be correct, an appropriate value for
would be
. The choice of
can be quite complicated for badly scaled problems; see Chapter 8 of
Gill et al. (1981) for a discussion of scaling techniques. The default value is appropriate for most simple functions that are computed with full accuracy. However when the accuracy of the computed function values is known to be significantly worse than full precision, the value of
should be large enough so that no attempt will be made to distinguish between function values that differ by less than the error inherent in the calculation.
Iteration Limit Default
Iters
Itns
The value of specifies the maximum number of iterations allowed before termination. If , the default value is used.
Problems whose Hessian matrices at the solution contain sets of clustered eigenvalues are likely to be minimized in significantly fewer than iterations. Problems without this property may require anything between and iterations, with approximately iterations being a common figure for moderately difficult problems.
Linesearch Tolerance Default
The value controls the accuracy with which the step taken during each iteration approximates a minimum of the function along the search direction (the smaller the value of , the more accurate the linesearch). The default value requests an inaccurate search, and is appropriate for most problems. A more accurate search may be appropriate when it is desirable to reduce the number of iterations – for example, if the objective function is cheap to evaluate. If or , the default value is used.
List
Nolist Default for nag_opt_uncon_conjgrd_comp (e04dg)
Normally each optional parameter specification is printed as it is supplied. Optional parameter
Nolist may be used to suppress the printing and optional parameter
List may be used to restore printing.
Maximum Step Length Default
If , the maximum allowable step length for the linesearch is taken as . If , the default value is used.
Optimality Tolerance Default
The parameter
specifies the accuracy to which you wish the final iterate to approximate a solution of the problem. Broadly speaking,
indicates the number of correct figures desired in the objective function at the solution. For example, if
is
and termination occurs with
(see
Arguments), then the final point satisfies the termination criteria, where
represents
Optimality Tolerance. If
or
, the default value is used.
Print Level
The value
controls the amount of printout produced by
nag_opt_uncon_conjgrd_comp (e04dg), as indicated below. A detailed description of the printout is given in
Description of Printed Output (summary output at each iteration and the final solution).
|
Output |
|
No output. |
|
The final solution only. |
|
One line of summary output ( characters; see Description of Printed Output) for each iteration (no printout of the final solution). |
|
The final solution and one line of summary output for each iteration. |
Start Objective Check at Variable Default
Stop Objective Check at Variable Default
These keywords take effect only if
. They may be used to control the verification of gradient elements computed by
objfun. For example, if the first
elements of the objective gradient appeared to be correct in an earlier run, so that only element
remains questionable, it is reasonable to specify
. If the first
variables appear linearly in the objective, so that the corresponding gradient elements are constant, the above choice would also be appropriate.
If or , the default value is used. If or , the default value is used.
Verify Level Default
Verify
Verify Gradients
Verify Objective Gradients
These keywords refer to finite difference checks on the gradient elements computed by
objfun. Gradients are verified at the user-supplied initial estimate of the solution. The possible choices for
are as follows:
|
Meaning |
|
No checks are performed. |
|
Only a ‘cheap’ test will be performed, requiring one call to objfun. |
|
In addition to the ‘cheap’ test, individual gradient elements will also be checked using a reliable (but more expensive) test. |
For example, the objective gradient will be verified if
Verify,
,
Verify Gradients,
Verify Objective Gradients or
is specified.
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015