h Chapter Contents
h Chapter Introduction
NAG Library Manual

# NAG Library Function Documentnag_mip_sqp (h02dac)

## 1  Purpose

nag_mip_sqp (h02dac) solves general nonlinear programming problems with integer constraints on some of the variables.

## 2  Specification

 #include #include
void  nag_mip_sqp (Integer n, Integer nclin, Integer ncnln, const double a[], Integer pda, const double d[], double ax[], const double bl[], const double bu[], const Integer varcon[], double x[],
 void (*confun)(Integer *mode, Integer ncnln, Integer n, const Integer varcon[], const double x[], double c[], double cjac[], Integer nstate, Nag_Comm *comm),
double c[], double cjac[],
 void (*objfun)(Integer *mode, Integer n, const Integer varcon[], const double x[], double *objmip, double objgrd[], Integer nstate, Nag_Comm *comm),
double objgrd[], Integer maxit, double acc, double *objmip, const Integer iopts[], const double opts[], Nag_Comm *comm, NagError *fail)
Before calling nag_mip_sqp (h02dac), nag_mip_opt_set (h02zkc) must be called with optstr set to ‘Initialize = h02dac’. Optional arguments may also be specified by calling nag_mip_opt_set (h02zkc) before the call to nag_mip_sqp (h02dac).

## 3  Description

nag_mip_sqp (h02dac) solves mixed integer nonlinear programming problems using a modified sequential quadratic programming method. The problem is assumed to be stated in the following general form:
 $minimize x∈ Rnc,Zni fx subject to cjx=0, j=1,2,…,me cjx≥0, j=me+1,me+2,…,m l≤xi≤u, i=1,2,…,n$
with ${n}_{c}$ continuous variables and ${n}_{i}$ binary and integer variables in a total of $n$ variables; ${m}_{e}$ equality constraints in a total of $m$ constraint functions.
Partial derivatives of $f\left(x\right)$ and $c\left(x\right)$ are not required for the ${n}_{i}$ integer variables. Gradients with respect to integer variables are approximated by difference formulae.
No assumptions are made regarding $f\left(x\right)$ except that it is twice continuously differentiable with respect to continuous elements of $x$. It is not assumed that integer variables are relaxable. In other words, problem functions are evaluated only at integer points.
The method seeks to minimize the exact penalty function:
 $Pσx = fx +σ gx ∞$
where $\sigma$ is adapted by the algorithm and $g\left(x\right)$ is given by:
 $gx = cjx, j=1,2,…,me = mincjx,0, j=me+1,me+2,…,m.$
Successive quadratic approximations are applied under the assumption that integer variables have a smooth influence on the model functions, that is function values do not change drastically when incrementing or decrementing an integer value. In practice this requires integer variables to be ordinal not categorical. The algorithm is stabilised by a trust region method including Yuan's second order corrections, see Yuan and Sun (2006). The Hessian of the Lagrangian function is approximated by BFGS (see Section 11.4 in nag_opt_nlp (e04ucc)) updates subject to the continuous and integer variables.
The mixed-integer quadratic programming subproblems of the SQP-trust region method are solved by a branch and cut method with continuous subproblem solutions obtained by the primal-dual method of Goldfarb and Idnani, see Powell (1983). Different strategies are available for selecting a branching variable:
• Maximal fractional branching. Select an integer variable from the relaxed subproblem solution with largest distance from next integer value
• Minimal fractional branching. Select an integer variable from the relaxed subproblem solution with smallest distance from next integer value
and a node from where branching, that is the generation of two new subproblems, begins:
• Best of two. The optimal objective function values of the two child nodes are compared and the node with a lower value is chosen
• Best of all. Select an integer variable from the relaxed subproblem solution with the smallest distance from the next integer value
• Depth first. Select a child node whenever possible.
This implementation is based on the algorithm MISQP as described in Exler et al. (2013).
Linear constraints may optionally be supplied by a matrix $A$ and vector $d$ rather than the constraint functions $c\left(x\right)$ such that
 $Ax=d or ​ Ax≥d .$
Partial derivatives with respect to $x$ of these constraint functions are not requested by nag_mip_sqp (h02dac).
Exler O, Lehmann T and Schittkowski K (2013) A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization Mathematical Programming Computation 4 383–412
Mann A (1986) GAMS/MINOS: Three examples Department of Operations Research Technical Report Stanford University
Powell M J D (1983) On the quadratic programming algorithm of Goldfarb and Idnani Report DAMTP 1983/Na 19 University of Cambridge, Cambridge
Yuan Y-x and Sun W (2006) Optimization Theory and Methods Springer–Verlag

## 5  Arguments

1:    $\mathbf{n}$IntegerInput
On entry: $n$, the total number of variables, ${n}_{c}+{n}_{i}$.
Constraint: ${\mathbf{n}}>0$.
2:    $\mathbf{nclin}$IntegerInput
On entry: ${n}_{l}$, the number of general linear constraints defined by $A$ and $d$.
Constraint: ${\mathbf{nclin}}\ge 0$.
3:    $\mathbf{ncnln}$IntegerInput
On entry: ${n}_{N}$, the number of constraints supplied by $c\left(x\right)$.
Constraint: ${\mathbf{ncnln}}\ge 0$.
4:    $\mathbf{a}\left[\mathit{dim}\right]$const doubleInput
Note: the dimension, dim, of the array a must be at least ${\mathbf{n}}$ when ${\mathbf{nclin}}>0$.
The $\left(i,j\right)$th element of the matrix $A$ is stored in ${\mathbf{a}}\left[\left(j-1\right)×{\mathbf{pda}}+i-1\right]$.
On entry: the $\mathit{i}$th row of a must contain the coefficients of the $\mathit{i}$th general linear constraint, for $\mathit{i}=1,2,\dots ,{n}_{l}$. Any equality constraints must be specified first.
If ${\mathbf{nclin}}=0$, the array a is not referenced and may be NULL.
5:    $\mathbf{pda}$IntegerInput
On entry: the stride separating matrix row elements in the array a.
Constraint: ${\mathbf{pda}}\ge {\mathbf{nclin}}$.
6:    $\mathbf{d}\left[{\mathbf{nclin}}\right]$const doubleInput
On entry: ${d}_{i}$, the constant for the $i$th linear constraint.
If ${\mathbf{nclin}}=0$, the array d is not referenced and may be NULL.
7:    $\mathbf{ax}\left[{\mathbf{nclin}}\right]$doubleOutput
On exit: the final values of the linear constraints $Ax$.
If ${\mathbf{nclin}}=0$, ax is not referenced and may be NULL.
8:    $\mathbf{bl}\left[{\mathbf{n}}\right]$const doubleInput
9:    $\mathbf{bu}\left[{\mathbf{n}}\right]$const doubleInput
On entry: ${\mathbf{bl}}$ must contain the lower bounds, ${l}_{i}$, and ${\mathbf{bu}}$ the upper bounds, ${u}_{i}$, for the variables; bounds on integer variables are rounded, bounds on binary variables need not be supplied.
Constraint: ${\mathbf{bl}}\left[\mathit{i}-1\right]\le {\mathbf{bu}}\left[\mathit{i}-1\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
10:  $\mathbf{varcon}\left[{\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}\right]$const IntegerInput
On entry: varcon indicates the nature of each variable and constraint in the problem. The first $n$ elements of the array must describe the nature of the variables, the next ${n}_{L}$ elements the nature of the general linear constraints (if any) and the next ${n}_{N}$ elements the general constraints (if any).
${\mathbf{varcon}}\left[j-1\right]=0$
A continuous variable.
${\mathbf{varcon}}\left[j-1\right]=1$
A binary variable.
${\mathbf{varcon}}\left[j-1\right]=2$
An integer variable.
${\mathbf{varcon}}\left[j-1\right]=3$
An equality constraint.
${\mathbf{varcon}}\left[j-1\right]=4$
An inequality constraint.
Constraints:
• ${\mathbf{varcon}}\left[\mathit{j}-1\right]=0$, $1$ or $2$, for $\mathit{j}=1,2,\dots ,{\mathbf{n}}$;
• ${\mathbf{varcon}}\left[\mathit{j}-1\right]=3$ or $4$, for $\mathit{j}={\mathbf{n}}+1,\dots ,{\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}$;
• At least one variable must be either binary or integer;
• Any equality constraints must precede any inequality constraints.
11:  $\mathbf{x}\left[{\mathbf{n}}\right]$doubleInput/Output
On entry: an initial estimate of the solution, which need not be feasible. Values corresponding to integer variables are rounded; if an initial value less than half is supplied for a binary variable the value zero is used, otherwise the value one is used.
On exit: the final estimate of the solution.
12:  $\mathbf{confun}$function, supplied by the userExternal Function
confun must calculate the constraint functions supplied by $c\left(x\right)$ and their Jacobian at $x$. If all constraints are supplied by $A$ and $d$ (i.e., ${\mathbf{ncnln}}=0$), confun will never be called by nag_mip_sqp (h02dac) and the NAG defined null void function pointer, NULLFN, may be supplied in the call instead. If ${\mathbf{ncnln}}>0$, the first call to confun will occur after the first call to objfun.
The specification of confun is:
 void confun (Integer *mode, Integer ncnln, Integer n, const Integer varcon[], const double x[], double c[], double cjac[], Integer nstate, Nag_Comm *comm)
1:    $\mathbf{mode}$Integer *Input/Output
On entry: indicates which values must be assigned during each call of objfun. Only the following values need be assigned:
${\mathbf{mode}}=0$
Elements of c containing continuous variables.
${\mathbf{mode}}=1$
Elements of cjac containing continuous variables.
On exit: may be set to a negative value if you wish to terminate the solution to the current problem, and in this case nag_mip_sqp (h02dac) will terminate with fail set to mode.
2:    $\mathbf{ncnln}$IntegerInput
On entry: the dimension of the array c and the first dimension of the array cjac. The number of constraints supplied by $c\left(x\right)$, ${n}_{N}$.
3:    $\mathbf{n}$IntegerInput
On entry: the second dimension of the array cjac. $n$, the total number of variables, ${n}_{c}+{n}_{i}$.
4:    $\mathbf{varcon}\left[{\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}\right]$const IntegerInput
Note: the dimension, dim, of the array varcon is ${\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}$.
On entry: the array varcon as supplied to nag_mip_sqp (h02dac).
5:    $\mathbf{x}\left[{\mathbf{n}}\right]$const doubleInput
On entry: the vector of variables at which the objective function and/or all continuous elements of its gradient are to be evaluated.
6:    $\mathbf{c}\left[{\mathbf{ncnln}}\right]$doubleOutput
On exit: must contain ncnln constraint values, with the value of the $j$th constraint ${c}_{j}\left(x\right)$ in ${\mathbf{c}}\left[j-1\right]$.
7:    $\mathbf{cjac}\left[{\mathbf{ncnln}}×{\mathbf{n}}\right]$doubleInput/Output
Note: the derivative of the $i$th constraint with respect to the $j$th variable, $\frac{\partial {c}_{i}}{\partial {x}_{j}}$, is stored in ${\mathbf{cjac}}\left[\left(j-1\right)×{\mathbf{ncnln}}+i-1\right]$.
On entry: continuous elements of cjac are set to the value of NaN.
On exit: the $i$th row of cjac must contain elements of $\frac{\partial {c}_{i}}{\partial {x}_{j}}$ for each continuous variable ${x}_{j}$.
8:    $\mathbf{nstate}$IntegerInput
On entry: if ${\mathbf{nstate}}=1$, nag_mip_sqp (h02dac) is calling confun for the first time. This argument setting allows you to save computation time if certain data must be read or calculated only once.
9:    $\mathbf{comm}$Nag_Comm *
Pointer to structure of type Nag_Comm; the following members are relevant to confun.
userdouble *
iuserInteger *
pPointer
The type Pointer will be void *. Before calling nag_mip_sqp (h02dac) you may allocate memory and initialize these pointers with various quantities for use by confun when called from nag_mip_sqp (h02dac) (see Section 3.2.1.1 in the Essential Introduction).
13:  $\mathbf{c}\left[{\mathbf{ncnln}}\right]$doubleOutput
On exit: if ${\mathbf{ncnln}}>0$, ${\mathbf{c}}\left[\mathit{j}-1\right]$ contains the value of the $\mathit{j}$th constraint function ${c}_{\mathit{j}}\left(x\right)$ at the final iterate, for $\mathit{j}=1,2,\dots ,{\mathbf{ncnln}}$.
If ${\mathbf{ncnln}}=0$, the array c is not referenced and may be NULL.
14:  $\mathbf{cjac}\left[{\mathbf{ncnln}}×{\mathbf{n}}\right]$doubleOutput
Note: the derivative of the $i$th constraint with respect to the $j$th variable, $\frac{\partial {c}_{i}}{\partial {x}_{j}}$, is stored in ${\mathbf{cjac}}\left[\left(j-1\right)×{\mathbf{ncnln}}+i-1\right]$.
On exit: if ${\mathbf{ncnln}}>0$, cjac contains the Jacobian matrix of the constraint functions at the final iterate, i.e., ${\mathbf{cjac}}\left[\left(\mathit{j}-1\right)×{\mathbf{ncnln}}+\mathit{i}-1\right]$ contains the partial derivative of the $\mathit{i}$th constraint function with respect to the $\mathit{j}$th variable, for $\mathit{i}=1,2,\dots ,{\mathbf{ncnln}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n}}$. (See the discussion of argument cjac under confun.)
If ${\mathbf{ncnln}}=0$, the array cjac is not referenced and may be NULL.
15:  $\mathbf{objfun}$function, supplied by the userExternal Function
objfun must calculate the objective function $f\left(x\right)$ and its gradient for a specified $n$-element vector $x$.
The specification of objfun is:
 void objfun (Integer *mode, Integer n, const Integer varcon[], const double x[], double *objmip, double objgrd[], Integer nstate, Nag_Comm *comm)
1:    $\mathbf{mode}$Integer *Input/Output
On entry: indicates which values must be assigned during each call of objfun. Only the following values need be assigned:
${\mathbf{mode}}=0$
The objective function value, objmip.
${\mathbf{mode}}=1$
The continuous elements of objgrd.
On exit: may be set to a negative value if you wish to terminate the solution to the current problem, and in this case nag_mip_sqp (h02dac) will terminate with fail set to mode.
2:    $\mathbf{n}$IntegerInput
On entry: $n$, the total number of variables, ${n}_{c}+{n}_{i}$.
3:    $\mathbf{varcon}\left[{\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}\right]$const IntegerInput
Note: the dimension, dim, of the array varcon is ${\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}$.
On entry: the array varcon as supplied to nag_mip_sqp (h02dac).
4:    $\mathbf{x}\left[{\mathbf{n}}\right]$const doubleInput
On entry: the vector of variables at which the objective function and/or all continuous elements of its gradient are to be evaluated.
5:    $\mathbf{objmip}$double *Output
On exit: must be set to the objective function value, $f$, if ${\mathbf{mode}}=0$; otherwise objmip is not referenced.
6:    $\mathbf{objgrd}\left[{\mathbf{n}}\right]$doubleInput/Output
On entry: continuous elements of objgrd are set to the value of NaN.
On exit: must contain the gradient vector of the objective function if ${\mathbf{mode}}=1$, with ${\mathbf{objgrd}}\left[j-1\right]$ containing the partial derivative of $f$ with respect to continuous variable ${x}_{j}$; otherwise objgrd is not referenced.
7:    $\mathbf{nstate}$IntegerInput
On entry: if ${\mathbf{nstate}}=1$, nag_mip_sqp (h02dac) is calling objfun for the first time. This argument setting allows you to save computation time if certain data must be read or calculated only once.
8:    $\mathbf{comm}$Nag_Comm *
Pointer to structure of type Nag_Comm; the following members are relevant to objfun.
userdouble *
iuserInteger *
pPointer
The type Pointer will be void *. Before calling nag_mip_sqp (h02dac) you may allocate memory and initialize these pointers with various quantities for use by objfun when called from nag_mip_sqp (h02dac) (see Section 3.2.1.1 in the Essential Introduction).
16:  $\mathbf{objgrd}\left[{\mathbf{n}}\right]$doubleOutput
On exit: the objective function gradient at the solution.
17:  $\mathbf{maxit}$IntegerInput
On entry: the maximum number of iterations within which to find a solution. If maxit is less than or equal to zero, the suggested value below is used.
Suggested value: ${\mathbf{maxit}}=500$.
18:  $\mathbf{acc}$doubleInput
On entry: the requested accuracy for determining feasible points during iterations and for halting the method when the predicted improvement in objective function is less than acc. If acc is less than or equal to $\epsilon$ ($\epsilon$ being the machine precision as given by nag_machine_precision (X02AJC)), the below suggested value is used.
Suggested value: ${\mathbf{acc}}=0.0001$.
19:  $\mathbf{objmip}$double *Output
On exit: with ${\mathbf{fail}}\mathbf{.}\mathbf{code}=$ NE_NOERROR, objmip contains the value of the objective function for the MINLP solution.
20:  $\mathbf{iopts}\left[\mathit{dim}\right]$const IntegerCommunication Array
Note: the dimension, $\mathit{dim}$, of this array is dictated by the requirements of associated functions that must have been previously called. This array MUST be the same array passed as argument iopts in the previous call to nag_mip_opt_set (h02zkc).
21:  $\mathbf{opts}\left[\mathit{dim}\right]$const doubleCommunication Array
Note: the dimension, $\mathit{dim}$, of this array is dictated by the requirements of associated functions that must have been previously called. This array MUST be the same array passed as argument opts in the previous call to nag_mip_opt_set (h02zkc).
On entry: the real option array as returned by nag_mip_opt_set (h02zkc).
22:  $\mathbf{comm}$Nag_Comm *
The NAG communication argument (see Section 3.2.1.1 in the Essential Introduction).
23:  $\mathbf{fail}$NagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.2.1.2 in the Essential Introduction for further information.
On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_BOUND
On entry, ${\mathbf{bl}}\left[〈\mathit{\text{value}}〉\right]>{\mathbf{bu}}\left[〈\mathit{\text{value}}〉\right]$.
Constraint: ${\mathbf{bl}}\left[\mathit{i}-1\right]\le {\mathbf{bu}}\left[\mathit{i}-1\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
NE_CONSTRAINT
On entry, linear equality constraints do not precede linear inequality constraints.
On entry, nonlinear equality constraints do not precede nonlinear inequality constraints.
NE_DERIV_ERRORS
One or more constraint gradients appear to be incorrect.
One or more objective gradients appear to be incorrect.
NE_INFEASIBLE
Termination at an infeasible iterate; if the problem is feasible, try a different starting value.
NE_INFINITE
Penalty parameter tends to infinity in an underlying mixed-integer quadratic program; the problem may be infeasible. If $\sigma$ is relatively low value, try a higher one, for example ${10}^{20}$.
Optional argument ${\mathbf{Penalty}}=〈\mathit{\text{value}}〉$.
NE_INITIALIZATION
On entry, the optional argument arrays iopts and opts have either not been initialized or been corrupted.
NE_INT
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}>0$.
On entry, ${\mathbf{nclin}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nclin}}\ge 0$.
On entry, ${\mathbf{ncnln}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{ncnln}}\ge 0$.
NE_INT_3
On entry, ${\mathbf{pda}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nclin}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{pda}}\ge {\mathbf{nclin}}$.
NE_INT_ARRAY_CONS
On entry, ${\mathbf{varcon}}\left[〈\mathit{\text{value}}〉\right]=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{varcon}}\left[\mathit{i}-1\right]=0$, $1$ or $2$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
On entry, ${\mathbf{varcon}}\left[〈\mathit{\text{value}}〉\right]=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{varcon}}\left[\mathit{i}-1\right]=3$ or $4$, for $\mathit{i}={\mathbf{n}}+1,\dots ,{\mathbf{n}}+{\mathbf{nclin}}+{\mathbf{ncnln}}$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 3.6.6 in the Essential Introduction for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 3.6.5 in the Essential Introduction for further information.
NE_NUM_DIFFICULTIES
The optimization failed due to numerical difficulties. Set optional argument ${\mathbf{Print Level}}=3$ for more information.
NE_TOO_MANY
More than the maximum number of feasible steps without improvement in the objective function. If the maximum number of feasible steps is small, say less than $5$, try increasing it. Optional argument ${\mathbf{Feasible Steps}}=〈\mathit{\text{value}}〉$.
NE_USER_NAN
The supplied confun returned a NaN value.
The supplied objfun returned a NaN value.
NE_USER_STOP
The optimization halted because you set mode negative in objfun or mode negative in confun, to $〈\mathit{\text{value}}〉$.
NE_ZERO_COEFF
Termination with zero integer trust region for integer variables; try a different starting value.
Optional argument ${\mathbf{Integer Trust Radius}}=〈\mathit{\text{value}}〉$.
NE_ZERO_VARS
On entry, there are no binary or integer variables.
NW_TOO_MANY_ITER
On entry, ${\mathbf{maxit}}=〈\mathit{\text{value}}〉$. Exceeded the maximum number of iterations.

Not applicable.

## 8  Parallelism and Performance

nag_mip_sqp (h02dac) is not threaded by NAG in any implementation.
nag_mip_sqp (h02dac) 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 function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

None.

## 10  Example

Select a portfolio of at most $p$ assets from $n$ available with expected return $\rho$, is fully invested and that minimizes
 $xTΣx subject to rTx = ρ ∑ i=1 n xi = 1 xi ≤ yi ∑ i=1 n yi ≤ p xi ≥ 0 yi = 0 or 1$
where
• $x$ is a vector of proportions of selected assets
• $y$ is an indicator variable that describes if an asset is in or out
• $r$ is a vector of mean returns
• $\Sigma$ is the covariance matrix of returns.
This example is taken from Mann (1986) with
 $r = 89127 Σ = 43-10 3610 -11100 0000 p = 3 ρ = 10.$
Linear constraints are supplied through both $A$ and $d$, and confun.

### 10.1  Program Text

Program Text (h02dace.c)

None.

### 10.3  Program Results

Program Results (h02dace.r)

## 11  Optional Arguments

This section can be skipped if you wish to use the default values for all optional arguments, otherwise, the following is a list of the optional arguments available and a full description of each optional argument is provided in Section 11.1.

### 11.1  Description of the Optional Arguments

For each option, we give a summary line, a description of the optional argument and details of constraints.
The summary line contains:
• the keywords;
• a parameter value, where the letters $a$, $i$ and $r$ denote options that take character, integer and real values respectively.
All options accept the value $\mathrm{DEFAULT}$ in order to return single options to their default states.
Keywords and character values are case insensitive, however they must be separated by at least one space.
nag_mip_opt_set (h02zkc) can be called to supply options, one call being necessary for each optional parameter. For example,
```Call H02ZKF('Check Gradients = Yes', iopts, liopts, opts, lopts, ifail)
```
nag_mip_opt_set (h02zkc) should be consulted for a full description of the method of supplying optional parameters.
For nag_mip_sqp (h02dac) the maximum length of the argument cvalue used by nag_mip_opt_get (h02zlc) is $12$.
 Branch Bound Steps $i$ Default$\text{}=500$
Maximum number of branch-and-bound steps for solving the mixed integer quadratic problems.
Constraint: ${\mathbf{Branch Bound Steps}}>1$.
 Branching Rule $a$ Default$\text{}=\mathrm{Maximum}$
Branching rule for branch and bound search.
${\mathbf{Branching Rule}}=\mathrm{Maximum}$
Maximum fractional branching.
${\mathbf{Branching Rule}}=\mathrm{Minimum}$
Minimum fractional branching.
 Check Gradients $a$ Default$\text{}=\mathrm{No}$
Perform an internal check of supplied objective and constraint gradients. It is advisable to set ${\mathbf{Check Gradients}}=\mathrm{Yes}$ during code development to avoid difficulties associated with incorrect user-supplied gradients.
 Continuous Trust Radius $r$ Default$\text{}=10.0$
Initial continuous trust region radius, ${\Delta }_{0}^{c}$; the initial trial step $d\in {R}^{{n}_{c}}$ for the SQP approximation must satisfy ${‖d‖}_{\infty }\le {\Delta }_{0}^{c}$.
Constraint: ${\mathbf{Continuous Trust Radius}}>0.0$.
 Descent $r$ Default$\text{}=0.05$
Initial descent parameter, $\delta$, larger values of $\delta$ allow penalty parameter $\sigma$ to increase faster which can lead to faster convergence.
Constraint: $0.0<{\mathbf{Descent}}<1.0$.
 Descent Factor $r$ Default$\text{}=0.1$
Factor for decreasing the internal descent parameter, $\delta$, between iterations.
Constraint: $0.0<{\mathbf{Descent Factor}}<1.0$.
 Feasible Steps $i$ Default$\text{}=10$
Maximum number of feasible steps without improvements, where feasibility is measured by ${‖g\left(x\right)‖}_{\infty }\le \sqrt{{\mathbf{acc}}}$.
Constraint: ${\mathbf{Feasible Steps}}>1$.
 Improved Bounds $a$ Default$\text{}=\mathrm{No}$
Calculate improved bounds in case of ‘Best of all’ node selection strategy.
 Integer Trust Radius $r$ Default$\text{}=10.0$
Initial integer trust region radius, ${\Delta }_{0}^{i}$; the initial trial step $e\in {R}^{{n}_{i}}$ for the SQP approximation must satisfy ${‖e‖}_{\infty }\le {\Delta }_{0}^{i}$.
Constraint: ${\mathbf{Integer Trust Radius}}\ge 1.0$.
 Maximum Restarts $i$ Default$\text{}=2$
Maximum number of restarts that allow the mixed integer SQP algorithm to return to a better solution. Setting a value higher than the default might lead to better results at the expense of function evaluations.
Constraint: $0<{\mathbf{Maximum Restarts}}\le 15$.
 Minor Print Level $i$ Default$\text{}=0$
Print level of the subproblem solver. Active only if ${\mathbf{Print Level}}\ne 0$.
Constraint: $0<{\mathbf{Minor Print Level}}<4$.
 Modify Hessian $a$ Default$\text{}=\mathrm{Yes}$
Modify the Hessian approximation in an attempt to get more accurate search directions. Calculation time is increased when the number of integer variables is large.
 Node Selection $a$ Default$\text{}=\mathrm{Depth First}$
Node selection strategy for branch and bound.
${\mathbf{Node Selection}}=\mathrm{Best of all}$
Large tree search; this method is the slowest as it solves all subproblem QPs independently.
${\mathbf{Node Selection}}=\mathrm{Best of two}$
Uses warm starts and less memory.
${\mathbf{Node Selection}}=\mathrm{Depth first}$
Uses more warm starts. If warm starts are applied, they can speed up the solution of mixed integer subproblems significantly when solving almost identical QPs.
 Non Monotone $i$ Default$\text{}=10$
Maximum number of successive iterations considered for the non-monotone trust region algorithm, allowing the penalty function to increase.
Constraint: $0<{\mathbf{Non Monotone}}<100$.
 Objective Scale Bound $r$ Default$\text{}=1.0$
When ${\mathbf{Scale Objective Function}}>0$ internally scale absolute function values greater than $1.0$ or ${\mathbf{Objective Scale Bound}}$.
Constraint: ${\mathbf{Objective Scale Bound}}>0.0$.
 Penalty $r$ Default$\text{}=1000.0$
Initial penalty parameter, $\sigma$.
Constraint: ${\mathbf{Penalty}}\ge 0.0$.
 Penalty Factor $r$ Default$\text{}=10.0$
Factor for increasing penalty parameter $\sigma$ when the trust regions cannot be enlarged at a trial step.
Constraint: ${\mathbf{Penalty Factor}}>1.0$.
 Print Level $i$ Default$\text{}=0$
Specifies the desired output level of printing.
${\mathbf{Print Level}}=\mathrm{0}$
No output.
${\mathbf{Print Level}}=\mathrm{1}$
Final convergence analysis.
${\mathbf{Print Level}}=\mathrm{2}$
One line of intermediate results per iteration.
${\mathbf{Print Level}}=\mathrm{3}$
Detailed information printed per iteration.
 QP Accuracy $r$ Default$\text{}=\text{1.0e−10}$
Termination tolerance of the relaxed quadratic program subproblems.
Constraint: ${\mathbf{QP Accuracy}}>0.0$.
 Scale Continuous Variables $a$ Default$\text{}=\mathrm{Yes}$
Internally scale continuous variables values.
 Scale Objective Function $i$ Default$\text{}=1$
Internally scale objective function values.
${\mathbf{Scale Objective Function}}=\mathrm{0}$
No scaling.
${\mathbf{Scale Objective Function}}=\mathrm{1}$
Scale absolute values greater than ${\mathbf{Objective Scale Bound}}$.
 Warm Starts $i$ Default$\text{}=100$
Maximum number of warm starts within the mixed integer QP solver, see ${\mathbf{Node Selection}}$.
Constraint: ${\mathbf{Warm Starts}}\ge 0$.