e04 Chapter Contents
e04 Chapter Introduction
NAG C Library Manual

# NAG Library Function Documentnag_opt_sparse_nlp_solve (e04vhc)

Note: this function uses optional arguments to define choices in the problem specification and in the details of the algorithm. If you wish to use default settings for all of the optional arguments, you need only read Sections 1 to 9 of this document. If, however, you wish to reset some or all of the settings please refer to Section 10 for a detailed description of the algorithm, to Section 11 for a detailed description of the specification of the optional arguments and to Section 12 for a detailed description of the monitoring information produced by the function.

## 1  Purpose

nag_opt_sparse_nlp_solve (e04vhc) solves sparse linear and nonlinear programming problems.

## 2  Specification

 #include #include
void  nag_opt_sparse_nlp_solve (Nag_Start start, Integer nf, Integer n, Integer nxname, Integer nfname, double objadd, Integer objrow, const char *prob,
 void (*usrfun)(Integer *status, Integer n, const double x[], Integer needf, Integer nf, double f[], Integer needg, Integer leng, double g[], Nag_Comm *comm),
const Integer iafun[], const Integer javar[], const double a[], Integer lena, Integer nea, const Integer igfun[], const Integer jgvar[], Integer leng, Integer neg, const double xlow[], const double xupp[], const char *xnames[], const double flow[], const double fupp[], const char *fnames[], double x[], Integer xstate[], double xmul[], double f[], Integer fstate[], double fmul[], Integer *ns, Integer *ninf, double *sinf, Nag_E04State *state, Nag_Comm *comm, NagError *fail)
Before calling nag_opt_sparse_nlp_solve (e04vhc), or one of the option setting functions function nag_opt_sparse_nlp_init (e04vgc) must be called. The specification for nag_opt_sparse_nlp_init (e04vgc) is:
 #include #include
 void nag_opt_sparse_nlp_init (Nag_E04State *state, NagError *fail)
The contents of state must not be altered between calling functions

## 3  Description

nag_opt_sparse_nlp_solve (e04vhc) is designed to minimize a linear or nonlinear function subject to bounds on the variables and sparse linear or nonlinear constraints. It is suitable for large-scale linear and quadratic programming and for linearly constrained optimization, as well as for general nonlinear programs of the form
 $minimizex f0x subject to ​ l ≤ x fx ALx ≤ u ,$ (1)
where $x$ is an $n$-vector of variables, $l$ and $u$ are constant lower and upper bounds, ${f}_{0}\left(x\right)$ is a smooth scalar objective function, ${A}_{L}$ is a sparse matrix, and $f\left(x\right)$ is a vector of smooth nonlinear constraint functions $\left\{{f}_{i}\left(x\right)\right\}$. The optional argument ${\mathbf{Maximize}}$ specifies that ${f}_{0}\left(x\right)$ should be maximized instead of minimized.
Ideally, the first derivatives (gradients) of ${f}_{0}\left(x\right)$ and ${f}_{i}\left(x\right)$ should be known and coded by you. If only some of the gradients are known, nag_opt_sparse_nlp_solve (e04vhc) estimates the missing ones by finite differences.
If ${f}_{0}\left(x\right)$ is linear and $f\left(x\right)$ is absent, (1) is a linear program (LP) and nag_opt_sparse_nlp_solve (e04vhc) applies the primal simplex method (see Dantzig (1963)). Sparse basis factors are maintained by LUSOL (see Gill et al. (1987)) as in MINOS (see Murtagh and Saunders (1995)).
If only the objective is nonlinear, the problem is linearly constrained (LC) and tends to solve more easily than the general case with nonlinear constraints (NC). For both nonlinear cases, nag_opt_sparse_nlp_solve (e04vhc) applies a sparse sequential quadratic programming (SQP) method (see Gill et al. (2002)), using limited-memory quasi-Newton approximations to the Hessian of the Lagrangian. The merit function for step-length control is an augmented Lagrangian, as in the dense SQP solver nag_opt_nlp_solve (e04wdc) (see Gill et al. (1986) and Gill et al. (1992)).
nag_opt_sparse_nlp_solve (e04vhc) is suitable for nonlinear problems with thousands of constraints and variables, and is most efficient if only some of the variables enter nonlinearly, or there are relatively few degrees of freedom at a solution (i.e., many constraints are active). However, there is no limit on the number of degrees of freedom.
nag_opt_sparse_nlp_solve (e04vhc) allows linear and nonlinear constraints and variables to be entered in an arbitrary order, and uses one function to define all the nonlinear functions.
The optimization problem is assumed to be in the form
 $minimizex Fobj x subject to ​ lx ≤ x ≤ ux , lF ≤ Fx ≤ uF ,$ (2)
where the upper and lower bounds are constant, $F\left(x\right)$ is a vector of smooth linear and nonlinear constraint functions $\left\{{F}_{i}\left(x\right)\right\}$, and ${F}_{\mathrm{obj}}\left(x\right)$ is one of the components of $F$ to be minimized, as specified by the input argument objrow. nag_opt_sparse_nlp_solve (e04vhc) reorders the variables and constraints so that the problem is in the form (1).
Upper and lower bounds are specified for all variables and functions. The $j$th constraint may be defined as an equality by setting ${l}_{j}={u}_{j}$. If certain bounds are not present, the associated elements of $l$ or $u$ should be set to special values that are treated as $-\infty$ or $+\infty$. Free variables and free constraints (‘free rows’) have both bounds infinite.
In general, the components of $F$ are structured in the sense that they are formed from sums of linear and nonlinear functions of just some of the variables. This structure can be exploited by nag_opt_sparse_nlp_solve (e04vhc).
In many cases, the vector $F\left(x\right)$ is a sum of linear and nonlinear functions. nag_opt_sparse_nlp_solve (e04vhc) allows these terms to be specified separately, so that the linear part is defined just once by the input arguments iafun, javar and a. Only the nonlinear part is recomputed at each $x$.
Suppose that each component of $F\left(x\right)$ is of the form
 $Fix = fix + ∑ j=1 n Aij xj ,$
where ${f}_{i}\left(x\right)$ is a nonlinear function (possibly zero) and the elements ${A}_{ij}$ are constant. The $nf$ by $n$ Jacobian of $F\left(x\right)$ is the sum of two sparse matrices of the same size: ${F}^{\prime }\left(x\right)=G\left(x\right)+A$, where $G\left(x\right)={f}^{\prime }\left(x\right)$ and $A$ is the matrix with elements $\left\{{A}_{ij}\right\}$. The two matrices must be non-overlapping in the sense that each element of the Jacobian ${F}^{\prime }\left(x\right)=G\left(x\right)+A$ comes from $G\left(x\right)$ or $A$, but not both. The element cannot be split between $G\left(x\right)$ and $A$.
For example, the function
 $Fx = 3x1 + ex2 x4 + x22 + 4x4 - x3 + x5 x2 + x32 + sin⁡x4 - 3x5 x1 - x3$
can be written as
 $Fx = fx + Ax = ex2 x4 + x22 + 4x4 x32 + sin⁡x4 0 + 3x1 - x3 + x5 x2 - 3x5 x1 - x3 ,$
in which case
 $F′x = 3 ex2 x4 + 2x2 -1 ex2 + 4 -1 0 1 2x3 cos⁡x4 -3 1 0 -1 0 -0$
can be written as ${F}^{\prime }\left(x\right)={f}^{\prime }\left(x\right)+A=G\left(x\right)+A$, where
 $Gx = 0 ex2 x4 + 2x2 0 ex2 + 4 0 0 0 2x3 cos⁡x4 0 0 0 0 0 0 , A = 3 0 -1 0 -1 0 1 -0 0 -3 1 0 -1 0 -0 .$
Note:  the element ${e}^{{x}_{2}}+4$ of ${F}^{\prime }\left(x\right)$ appears in $G\left(x\right)$ and is not split between $G\left(x\right)$ and $A$ although it contains a linear term.
The nonzero elements of $A$ and $G$ are provided to nag_opt_sparse_nlp_solve (e04vhc) in coordinate form. The elements of $A$ are entered as triples $\left(i,j,{A}_{ij}\right)$ in the arrays iafun, javar and a. The sparsity pattern $G$ is entered as pairs $\left(i,j\right)$ in the arrays igfun and jgvar. The corresponding entries ${G}_{ij}$ (any that are known) are assigned to appropriate array elements ${\mathbf{g}}\left(k\right)$ in usrfun.
The elements of $A$ and $G$ may be stored in any order. Duplicate entries are ignored. igfun and jgvar may be defined automatically by function nag_opt_sparse_nlp_jacobian (e04vjc) when ${\mathbf{Derivative Option}}=0$ is specified and usrfun does not provide any gradients.
Throughout this document the symbol $\epsilon$ is used to represent the machine precision (see nag_machine_precision (X02AJC)).
nag_opt_sparse_nlp_solve (e04vhc) is based on SNOPTA, which is part of the SNOPT package described in Gill et al. (2005b).

## 4  References

Dantzig G B (1963) Linear Programming and Extensions Princeton University Press
Eldersveld S K (1991) Large-scale sequential quadratic programming algorithms PhD Thesis Department of Operations Research, Stanford University, Stanford
Fourer R (1982) Solving staircase linear programs by the simplex method Math. Programming 23 274–313
Gill P E, Murray W and Saunders M A (2002) SNOPT: An SQP Algorithm for Large-scale Constrained Optimization 12 979–1006 SIAM J. Optim.
Gill P E, Murray W and Saunders M A (2005a) Users' guide for SQOPT 7: a Fortran package for large-scale linear and quadratic programming Report NA 05-1 Department of Mathematics, University of California, San Diego ftp://www.cam.ucsd.edu/pub/peg/reports/sqdoc7.pdf
Gill P E, Murray W and Saunders M A (2005b) Users' guide for SNOPT 7.1: a Fortran package for large-scale linear nonlinear programming Report NA 05-2 Department of Mathematics, University of California, San Diego ftp://www.cam.ucsd.edu/pub/peg/reports/sndoc7.pdf
Gill P E, Murray W, Saunders M A and Wright M H (1986) Users' guide for NPSOL (Version 4.0): a Fortran package for nonlinear programming Report SOL 86-2 Department of Operations Research, Stanford University
Gill P E, Murray W, Saunders M A and Wright M H (1987) Maintaining LU factors of a general sparse matrix Linear Algebra and its Applics. 88/89 239–270
Gill P E, Murray W, Saunders M A and Wright M H (1992) Some theoretical properties of an augmented Lagrangian merit function Advances in Optimization and Parallel Computing (ed P M Pardalos) 101–128 North Holland
Hock W and Schittkowski K (1981) Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems 187 Springer–Verlag
Murtagh B A and Saunders M A (1978) Large-scale linearly constrained optimization 14 41–72 Math. Program.
Murtagh B A and Saunders M A (1982) A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints Math. Program. Stud. 16 84–118
Murtagh B A and Saunders M A (1995) MINOS 5.4 users' guide Report SOL 83-20R Department of Operations Research, Stanford University

## 5  Arguments

1:     startNag_StartInput
On entry: indicates how a starting point is to be obtained.
${\mathbf{start}}=\mathrm{Nag_Cold}$
Requests that the Crash procedure be used, unless a Basis file is provided via optional arguments ${\mathbf{Old Basis File}}$, ${\mathbf{Insert File}}$ or ${\mathbf{Load File}}$.
${\mathbf{start}}=\mathrm{Nag_BasisFile}$
Is the same as ${\mathbf{start}}=\mathrm{Nag_Cold}$ but is more meaningful when a Basis file is given.
${\mathbf{start}}=\mathrm{Nag_Warm}$
Means that xstate and fstate define a valid starting point (probably from an earlier call, though not necessarily).
Constraint: ${\mathbf{start}}=\mathrm{Nag_Cold}$, $\mathrm{Nag_BasisFile}$ or $\mathrm{Nag_Warm}$.
2:     nfIntegerInput
On entry: $\mathit{nf}$, the number of problem functions in $F\left(x\right)$, including the objective function (if any) and the linear and nonlinear constraints. Upper and lower bounds on $x$ can be defined using the arguments xlow and xupp and should not be included in $F$.
Constraint: ${\mathbf{nf}}>0$.
3:     nIntegerInput
On entry: $n$, the number of variables.
Constraint: ${\mathbf{n}}>0$.
4:     nxnameIntegerInput
On entry: the number of names provided in the array xnames.
${\mathbf{nxname}}=1$
There are no names provided and generic names will be used in the output.
${\mathbf{nxname}}={\mathbf{n}}$
Names for all variables must be provided and will be used in the output.
Constraint: ${\mathbf{nxname}}=1\text{​ or ​}{\mathbf{n}}$.
5:     nfnameIntegerInput
On entry: the number of names provided in the array fnames.
${\mathbf{nfname}}=1$
There are no names provided and generic names will be used in the output.
${\mathbf{nfname}}={\mathbf{nf}}$
Names for all functions must be provided and will be used in the output.
Constraint: ${\mathbf{nfname}}=1\text{​ or ​}{\mathbf{nf}}$.
Note: if ${\mathbf{nxname}}=1$ then nfname must also be $1$ (and vice versa). Similarly, if ${\mathbf{nxname}}={\mathbf{n}}$ then nfname must be nf (and vice versa).
On entry: is a constant that will be added to the objective row ${F}_{\mathrm{obj}}$ for printing purposes. Typically, ${\mathbf{objadd}}=0.0$.
7:     objrowInteger Input
On entry: says which row of $F\left(x\right)$ is to act as the objective function. If there is no such row, set ${\mathbf{objrow}}=0$. Then nag_opt_sparse_nlp_solve (e04vhc) will seek a feasible point such that ${l}_{F}\le F\left(x\right)\le {u}_{F}$ and ${l}_{x}\le x\le {u}_{x}$.
Constraint: $1\le {\mathbf{objrow}}\le {\mathbf{nf}}\text{​ or ​}{\mathbf{objrow}}=0$ (or a feasible point problem).
8:     probconst char *Input
On entry: the name for the problem. prob is used in the printed solution and in some functions that output Basis files. Only the first eight characters of prob are significant.
9:     usrfunfunction, supplied by the userExternal Function
usrfun must define the nonlinear portion $f\left(x\right)$ of the problem functions $F\left(x\right)=f\left(x\right)+Ax$, along with its gradient elements ${G}_{ij}\left(x\right)=\frac{\partial {f}_{i}\left(x\right)}{\partial {x}_{j}}$. A dummy function is needed even if $f\left(x\right)=0$ and all functions are linear.
In general, usrfun should return all function and gradient values on every entry except perhaps the last. This provides maximum reliability and corresponds to the default option setting, ${\mathbf{Derivative Option}}=1$.
The elements of $G\left(x\right)$ are stored in the array ${\mathbf{g}}\left[\mathit{i}-1\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{leng}}$, in the order specified by the input arrays igfun and jgvar.
In practice it is often convenient not to code gradients. nag_opt_sparse_nlp_solve (e04vhc) is able to estimate them by finite differences, using a call to usrfun for each variable ${x}_{j}$ for which some $\frac{\partial {f}_{i}\left(x\right)}{\partial {x}_{j}}$ needs to be estimated. However, this reduces the reliability of the optimization algorithm, and it can be very expensive if there are many such variables ${x}_{j}$.
As a compromise, nag_opt_sparse_nlp_solve (e04vhc) allows you to code as many gradients as you like. This option is implemented as follows. Just before usrfun is called, each element of the derivative array g is initialized to a specific value. On exit, any element retaining that value must be estimated by finite differences.
Some rules of thumb follow:
 (i) for maximum reliability, compute all gradients; (ii) if the gradients are expensive to compute, specify optional argument ${\mathbf{Nonderivative Linesearch}}$ and use the value of the input argument needg to avoid computing them on certain entries. (There is no need to compute gradients if ${\mathbf{needg}}=0$ on entry to usrfun.); (iii) if not all gradients are known, you must specify ${\mathbf{Derivative Option}}=0$. You should still compute as many gradients as you can. (It often happens that some of them are constant or zero.); (iv) again, if the known gradients are expensive, don't compute them if ${\mathbf{needg}}=0$ on entry to usrfun; (v) use the input argument status to test for special actions on the first or last entries; (vi) while usrfun is being developed, use the optional argument ${\mathbf{Verify Level}}$ to check the computation of gradients that are supposedly known; (vii) usrfun is not called until the linear constraints and bounds on $x$ are satisfied. This helps confine $x$ to regions where the functions ${f}_{i}\left(x\right)$ are likely to be defined. However, be aware of the optional argument ${\mathbf{Minor Feasibility Tolerance}}$ if the functions have singularities on the constraint boundaries; (viii) set ${\mathbf{status}}=-1$ if some of the functions are undefined. The linesearch will shorten the step and try again; (ix) set ${\mathbf{status}}\le -2$ if you want nag_opt_sparse_nlp_solve (e04vhc) to stop.
The specification of usrfun is:
 void usrfun (Integer *status, Integer n, const double x[], Integer needf, Integer nf, double f[], Integer needg, Integer leng, double g[], Nag_Comm *comm)
1:     statusInteger *Input/Output
On entry: indicates the first and last calls to usrfun.
${\mathbf{status}}=0$
There is nothing special about the current call to usrfun.
${\mathbf{status}}=1$
nag_opt_sparse_nlp_solve (e04vhc) is calling your function for the first time. You may wish to do something special such as read data from a file.
${\mathbf{status}}\ge 2$
nag_opt_sparse_nlp_solve (e04vhc) is calling your function for the last time. This argument setting allows you to perform some additional computation on the final solution.
${\mathbf{status}}=2$
The current x is optimal.
${\mathbf{status}}=3$
The problem appears to be infeasible.
${\mathbf{status}}=4$
The problem appears to be unbounded.
${\mathbf{status}}=5$
An iterations limit was reached.
If the functions are expensive to evaluate, it may be desirable to do nothing on the last call. The first executable statement could be
`if (*status ≥ 2) return;`
On exit: may be used to indicate that you are unable to evaluate $f$ or its gradients at the current $x$. (For example, the problem functions may not be defined there.)
During the linesearch, $f\left(x\right)$ is evaluated at points $x={x}_{k}+\alpha {p}_{k}$ for various step lengths $\alpha$, where $f\left({x}_{k}\right)$ has already been evaluated satisfactorily. For any such $x$, if you set ${\mathbf{status}}=-1$, nag_opt_sparse_nlp_solve (e04vhc) will reduce $\alpha$ and evaluate $f$ again (closer to ${x}_{k}$, where $f\left({x}_{k}\right)$ is more likely to be defined).
If for some reason you wish to terminate the current problem, set ${\mathbf{status}}\le -2$.
2:     nIntegerInput
On entry: $n$, the number of variables, as defined in the call to nag_opt_sparse_nlp_solve (e04vhc).
3:     x[n]const doubleInput
On entry: the variables $x$ at which the problem functions are to be calculated. The array $x$ must not be altered.
4:     needfIntegerInput
On entry: indicates whether f must be assigned during this call of usrfun.
${\mathbf{needf}}=0$
f is not required and is ignored.
${\mathbf{needf}}>0$
The components of $f\left(x\right)$ corresponding to the nonlinear part of $F\left(x\right)$ must be calculated and assigned to f.
If ${F}_{i}\left(x\right)$ is linear and completely defined by the $i$th row of $A$, ${A}_{i}^{\prime }$, then the associated value ${f}_{i}\left(x\right)$ is ignored and need not be assigned. However, if ${F}_{i}\left(x\right)$ has a nonlinear portion ${f}_{i}\left(x\right)$ that happens to be zero at $x$, then it is still necessary to set ${f}_{i}\left(x\right)=0$. If the linear part ${A}_{i}^{\prime }$ of a nonlinear ${F}_{i}\left(x\right)$ is provided using the arrays iafun, javar and a, then it must not be computed again as part of ${f}_{i}\left(x\right)$.
To simplify the code, you may ignore the value of needf and compute $f\left(x\right)$ on every entry to usrfun.
needf may also be ignored with ${\mathbf{Derivative Linesearch}}$ and ${\mathbf{Derivative Option}}=1$. In this case, needf is always $1$, and f must always be assigned.
5:     nfIntegerInput
On entry: is the length of the full vector $F\left(x\right)=f\left(x\right)+Ax$ as defined in the call to nag_opt_sparse_nlp_solve (e04vhc).
6:     f[nf]doubleInput/Output
On entry: concerns the calculation of $f\left(x\right)$.
On exit: f contains the computed functions $f\left(x\right)$ (except perhaps if ${\mathbf{needf}}=0$).
7:     needgIntegerInput
On entry: indicates whether g must be assigned during this call of usrfun.
${\mathbf{needg}}=0$
g is not required and is ignored.
${\mathbf{needg}}>0$
The partial derivatives of $f\left(x\right)$ must be calculated and assigned to g. The value of ${\mathbf{g}}\left[k-1\right]$ should be $\frac{\partial {f}_{i}\left(x\right)}{\partial {x}_{j}}$, where $i={\mathbf{igfun}}\left[k-1\right]$, $j={\mathbf{jgvar}}\left[k-1\right]$ and $k=1,2,\dots ,{\mathbf{leng}}$.
8:     lengIntegerInput
On entry: is the length of the coordinate arrays jgvar and igfun in the call to nag_opt_sparse_nlp_solve (e04vhc).
9:     g[leng]doubleInput/Output
On entry: concerns the calculations of the derivatives of the function $f\left(x\right)$.
On exit: contains the computed derivatives $G\left(x\right)$ (unless ${\mathbf{needg}}=0$).
These derivative elements must be stored in g in exactly the same positions as implied by the definitions of arrays igfun and jgvar. There is no internal check for consistency (except indirectly via the optional argument ${\mathbf{Verify Level}}$), so great care is essential.
10:   commNag_Comm *
Pointer to structure of type Nag_Comm; the following members are relevant to usrfun.
userdouble *
iuserInteger *
pPointer
The type Pointer will be void *. Before calling nag_opt_sparse_nlp_solve (e04vhc) you may allocate memory and initialize these pointers with various quantities for use by usrfun when called from nag_opt_sparse_nlp_solve (e04vhc) (see Section 3.2.1 in the Essential Introduction).
10:   iafun[lena]const IntegerInput
11:   javar[lena]const IntegerInput
12:   a[lena]const doubleInput
On entry: define the coordinates $\left(i,j\right)$ and values ${A}_{ij}$ of the nonzero elements of the linear part $A$ of the function $F\left(x\right)=f\left(x\right)+Ax$.
In particular, nea triples $\left({\mathbf{iafun}}\left[k-1\right],{\mathbf{javar}}\left[k-1\right],{\mathbf{a}}\left[k-1\right]\right)$ define the row and column indices $i={\mathbf{iafun}}\left[k-1\right]$ and $j={\mathbf{javar}}\left[k-1\right]$ of the element ${A}_{ij}={\mathbf{a}}\left[k-1\right]$.
The coordinates may define the elements of $A$ in any order.
13:   lenaIntegerInput
On entry: the dimension of the arrays iafun, javar and a that hold $\left(i,j,{A}_{ij}\right)$.
Constraint: ${\mathbf{lena}}\ge 1$.
14:   neaIntegerInput
On entry: is the number of nonzero entries in $A$ such that $F\left(x\right)=f\left(x\right)+Ax$.
Constraint: $0\le {\mathbf{nea}}\le {\mathbf{lena}}$.
15:   igfun[leng]const IntegerInput
16:   jgvar[leng]const IntegerInput
On entry: define the coordinates $\left(i,j\right)$ of the nonzero elements of $G$, the nonlinear part of the derivative $J\left(x\right)=G\left(x\right)+A$ of the function $F\left(x\right)=f\left(x\right)+Ax$. nag_opt_sparse_nlp_jacobian (e04vjc) may be used to define these two arrays.
The coordinates can define the elements of $G$ in any order. However, usrfun must define the actual elements of g in exactly the same order as defined by the coordinates $\left({\mathbf{igfun}},{\mathbf{jgvar}}\right)$.
17:   lengIntegerInput
On entry: the dimension of the arrays igfun and jgvar that define the varying Jacobian elements $\left(i,j,{G}_{ij}\right)$.
Constraint: ${\mathbf{leng}}\ge 1$.
18:   negIntegerInput
On entry: the number of nonzero entries in $G$.
Constraint: $0\le {\mathbf{neg}}\le {\mathbf{leng}}$.
19:   xlow[n]const doubleInput
20:   xupp[n]const doubleInput
On entry: contain the lower and upper bounds ${l}_{x}$ and ${u}_{x}$ on the variables $x$.
To specify a nonexistent lower bound ${\left[{l}_{x}\right]}_{j}=-\infty$, set ${\mathbf{xlow}}\left[j-1\right]\le -\mathit{bigbnd}$, where $\mathit{bigbnd}$ is the optional argument ${\mathbf{Infinite Bound Size}}$. To specify a nonexistent upper bound ${\left[{u}_{x}\right]}_{j}=\infty$, set ${\mathbf{xupp}}\left[j-1\right]\ge \mathit{bigbnd}$.
To fix the $j$th variable at ${x}_{j}=\beta$, where $\left|\beta \right|<\mathit{bigbnd}$, set ${\mathbf{xlow}}\left[j-1\right]={\mathbf{xupp}}\left[j-1\right]=\beta$.
Constraint: ${\mathbf{xlow}}\left[\mathit{i}-1\right]\le {\mathbf{xupp}}\left[\mathit{i}-1\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
21:   xnames[nxname]const char *Input
On entry: the optional names for the variables.
If ${\mathbf{nxname}}=1$, xnames is not referenced and default names will be used for output.
If ${\mathbf{nxname}}={\mathbf{n}}$, ${\mathbf{xnames}}\left[\mathit{j}-1\right]$ must contain the name of the $\mathit{j}$th variable, for $\mathit{j}=1,2,\dots ,{\mathbf{nxname}}$.
Note: that only the first eight characters of the rows of xnames are significant.
22:   flow[nf]const doubleInput
23:   fupp[nf]const doubleInput
On entry: contain the lower and upper bounds ${l}_{F}$ and ${u}_{F}$ on $F\left(x\right)$.
To specify a nonexistent lower bound ${\left[{l}_{F}\right]}_{i}=-\infty$, set ${\mathbf{flow}}\left[i-1\right]\le -\mathit{bigbnd}$. For a nonexistent upper bound ${\left[{u}_{F}\right]}_{i}=\infty$, set ${\mathbf{fupp}}\left[i-1\right]\ge \mathit{bigbnd}$.
To make the $i$th constraint an equality at ${F}_{i}=\beta$, where $\left|\beta \right|<\mathit{bigbnd}$, set ${\mathbf{flow}}\left[i-1\right]={\mathbf{fupp}}\left[i-1\right]=\beta$.
Constraint: ${\mathbf{flow}}\left[\mathit{i}-1\right]\le {\mathbf{fupp}}\left[\mathit{i}-1\right]$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
24:   fnames[nfname]const char *Input
On entry: the optional names for the problem functions.
If ${\mathbf{nfname}}=1$, fnames is not referenced and default names will be used for the output.
If ${\mathbf{nfname}}={\mathbf{nf}}$, ${\mathbf{fnames}}\left[\mathit{i}-1\right]$ should contain the name of the $\mathit{i}$th row of $F$, for $\mathit{i}=1,2,\dots ,{\mathbf{nfname}}$.
Note: that only the first eight characters of the rows of fnames are significant.
25:   x[n]doubleInput/Output
On entry: an initial estimate of the variables $x$. See the following description of xstate.
On exit: the final values of the variable $x$.
26:   xstate[n]IntegerInput/Output
On entry: the initial state for each variable $x$.
If ${\mathbf{start}}=\mathrm{Nag_Cold}$ or $\mathrm{Nag_BasisFile}$ and no basis information is provided (the optional arguments ${\mathbf{Old Basis File}}$, ${\mathbf{Insert File}}$ and ${\mathbf{Load File}}$ are all set to $0$; the default) x and xstate must be defined.
If nothing special is known about the problem, or if there is no wish to provide special information, you may set ${\mathbf{x}}\left[j-1\right]=0.0$, ${\mathbf{xstate}}\left[j-1\right]=0$, for all $j=1,2,\dots ,{\mathbf{n}}$. If you set ${\mathbf{x}}\left[j-1\right]={\mathbf{xlow}}\left[j-1\right]$ set ${\mathbf{xstate}}\left[j-1\right]=4$; if you set ${\mathbf{x}}\left[j-1\right]={\mathbf{xupp}}\left[j-1\right]$ then set ${\mathbf{xstate}}\left[j-1\right]=5$. In this case a Crash procedure is used to select an initial basis.
If ${\mathbf{start}}=\mathrm{Nag_Cold}$ or $\mathrm{Nag_BasisFile}$ and basis information is provided (at least one of the optional arguments ${\mathbf{Old Basis File}}$, ${\mathbf{Insert File}}$ and ${\mathbf{Load File}}$ is nonzero) x and xstate need not be set.
If ${\mathbf{start}}=\mathrm{Nag_Warm}$, x and xstate must be set (probably from a previous call). In this case ${\mathbf{xstate}}\left[\mathit{j}-1\right]$ must be $0$, $1$, $2\text{​ or ​}3$, for $\mathit{j}=1,2,\dots ,{\mathbf{n}}$.
On exit: the final state of the variables.
 ${\mathbf{xstate}}\left[j-1\right]$ State of variable $j$ Usual value of ${\mathbf{x}}\left[j-1\right]$ 0 nonbasic ${\mathbf{xlow}}\left[j-1\right]$ 1 nonbasic ${\mathbf{xupp}}\left[j-1\right]$ 2 superbasic Between ${\mathbf{xlow}}\left[j-1\right]$ and ${\mathbf{xupp}}\left[j-1\right]$ 3 basic Between ${\mathbf{xlow}}\left[j-1\right]$ and ${\mathbf{xupp}}\left[j-1\right]$
Basic and superbasic variables may be outside their bounds by as much as the optional argument ${\mathbf{Minor Feasibility Tolerance}}$. Note that if scaling is specified, the feasibility tolerance applies to the variables of the scaled problem. In this case, the variables of the original problem may be as much as $0.1$ outside their bounds, but this is unlikely unless the problem is very badly scaled. Check the value of Primal infeasibility output to the unit number associated with the optional argument ${\mathbf{Print File}}$.
Very occasionally some nonbasic variables may be outside their bounds by as much as the optional argument ${\mathbf{Minor Feasibility Tolerance}}$, and there may be some nonbasics for which ${\mathbf{x}}\left[j-1\right]$ lies strictly between its bounds.
If ${\mathbf{ninf}}>0$, some basic and superbasic variables may be outside their bounds by an arbitrary amount (bounded by sinf if scaling was not used).
Constraint: $0\le {\mathbf{xstate}}\left[j-1\right]\le 5\text{, for ​}j=1,2,\dots ,{\mathbf{n}}$.
27:   xmul[n]doubleOutput
On exit: the vector of the dual variables (Lagrange multipliers) for the simple bounds ${l}_{x}\le x\le {u}_{x}$.
28:   f[nf]doubleInput/Output
On entry: an initial value for the problem functions $F$. See the following description of fstate.
On exit: the final values for the problem functions $F$ (the values $F$ at the final point x).
29:   fstate[nf]IntegerInput/Output
On entry: the initial state for the problem functions $F$.
If ${\mathbf{start}}=\mathrm{Nag_Cold}$ or $\mathrm{Nag_BasisFile}$ and no basis information is provided (the optional arguments ${\mathbf{Old Basis File}}$, ${\mathbf{Insert File}}$ and ${\mathbf{Load File}}$ are all set to $0$; the default, f and fstate must be defined.
If nothing special is known about the problem, or if there is no wish to provide special information, you may set ${\mathbf{f}}\left[i-1\right]=0.0$, ${\mathbf{fstate}}\left[i-1\right]=0$, for all $i=1,2,\dots ,{\mathbf{nf}}$. Less trivially, to say that the optimal value of function ${\mathbf{f}}\left[i-1\right]$ will probably be equal to one of its bounds, set ${\mathbf{f}}\left[i-1\right]={\mathbf{flow}}\left[i-1\right]$ and ${\mathbf{fstate}}\left[i-1\right]=4$ or ${\mathbf{f}}\left[i-1\right]={\mathbf{fupp}}\left[i-1\right]$ and ${\mathbf{fstate}}\left[i-1\right]=5$ as appropriate. In this case a Crash procedure is used to select an initial basis.
If ${\mathbf{start}}=\mathrm{Nag_Cold}$ or $\mathrm{Nag_BasisFile}$ and basis information is provided (at least one of the optional arguments ${\mathbf{Old Basis File}}$, ${\mathbf{Insert File}}$ and ${\mathbf{Load File}}$ is nonzero), f and fstate need not be set.
If ${\mathbf{start}}=\mathrm{Nag_Warm}$, f and fstate must be set (probably from a previous call). In this case ${\mathbf{fstate}}\left[\mathit{i}-1\right]$ must be $0$, $1$, $2$ or $3$, for $\mathit{i}=1,2,\dots ,{\mathbf{nf}}$.
On exit: the final state of the variables. The elements of fstate have the following meaning:
 ${\mathbf{fstate}}\left[i-1\right]$ State of the correspondingslack variable Usual value of ${\mathbf{f}}\left[i-1\right]$ 0 nonbasic ${\mathbf{flow}}\left[i-1\right]$ 1 nonbasic ${\mathbf{fupp}}\left[i-1\right]$ 2 superbasic Between ${\mathbf{flow}}\left[i-1\right]$ and ${\mathbf{fupp}}\left[i-1\right]$ 3 basic Between ${\mathbf{flow}}\left[i-1\right]$ and ${\mathbf{fupp}}\left[i-1\right]$
Basic and superbasic slack variables may lead to the corresponding functions being outside their bounds by as much as the optional argument ${\mathbf{Minor Feasibility Tolerance}}$.
Very occasionally some functions may be outside their bounds by as much as the optional argument ${\mathbf{Minor Feasibility Tolerance}}$, and there may be some nonbasics for which ${\mathbf{f}}\left[i-1\right]$ lies strictly between its bounds.
If ${\mathbf{ninf}}>0$, some basic and superbasic variables may be outside their bounds by an arbitrary amount (bounded by sinf if scaling was not used).
Constraint: $0\le {\mathbf{fstate}}\left[i-1\right]\le 5\text{, for ​}i=1,2,\dots ,{\mathbf{nf}}$.
30:   fmul[nf]doubleInput/Output
On entry: an estimate of $\gamma$, the vector of Lagrange multipliers (shadow prices) for the constraints ${l}_{F}\le F\left(x\right)\le {u}_{F}$. All nf components must be defined. If nothing is known about $\gamma$, set ${\mathbf{fmul}}\left[\mathit{i}-1\right]=0.0$, for $\mathit{i}=1,2,\dots ,{\mathbf{nf}}$. For warm start use the values from a previous call.
On exit: the vector of the dual variables (Lagrange multipliers) for the general constraints ${l}_{F}\le F\left(x\right)\le {u}_{F}$
31:   nsInteger *Input/Output
On entry: the number of superbasic variables. ns need not be specified for cold starts, but should retain its value from a previous call when warm start is used.
On exit: the final number of superbasic variables.
32:   ninfInteger *Output
33:   sinfdouble *Output
On exit: are the number and the sum of the infeasibilities of constraints that lie outside one of their bounds by more than the optional argument ${\mathbf{Minor Feasibility Tolerance}}$ before the solution is unscaled.
If any linear constraints are infeasible, $x$ minimizes the sum of the infeasibilities of the linear constraints subject to the upper and lower bounds being satisfied. In this case ninf gives the number of variables and linear constraints lying outside their upper or lower bounds. The nonlinear constraints are not evaluated.
Otherwise, $x$ minimizes the sum of infeasibilities of the nonlinear constraints subject to the linear constraints and upper and lower bounds being satisfied. In this case ninf gives the number of components of $F\left(x\right)$ lying outside their bounds by more than the optional argument ${\mathbf{Minor Feasibility Tolerance}}$. Again this is before the solution is unscaled.
34:   stateNag_E04State *Communication Structure
state contains internal information required for functions in this suite. It must not be modified in any way.
35:   commNag_Comm *Communication Structure
The NAG communication argument (see Section 3.2.1.1 in the Essential Introduction).
36:   failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).
nag_opt_sparse_nlp_solve (e04vhc) returns with NE_NOERROR if the iterates have converged to a point $x$ that satisfies the first-order Kuhn–Tucker (see Section 12.2) conditions to the accuracy requested by the optional argument ${\mathbf{Major Optimality Tolerance}}$, i.e., the projected gradient and active constraint residuals are negligible at $x$.
You should check whether the following four conditions are satisfied:
 (i) the final value of rgNorm (see Section 12.2) is significantly less than that at the starting point; (ii) during the final major iterations, the values of Step and Minors (see Section 12.1) are both one; (iii) the last few values of both rgNorm and SumInf (see Section 12.2) become small at a fast linear rate; and (iv) condHz (see Section 12.1) is small.
If all these conditions hold, $x$ is almost certainly a local minimum of (1).
One caution about ‘Optimal solutions’. Some of the variables or slacks may lie outside their bounds more than desired, especially if scaling was requested. Max Primal infeas in the Print file (see Section 12) refers to the largest bound infeasibility and which variable is involved. If it is too large, consider restarting with a smaller ${\mathbf{Minor Feasibility Tolerance}}$ (say $10$ times smaller) and perhaps ${\mathbf{Scale Option}}=0$.
Similarly, Max Dual infeas in the Print file indicates which variable is most likely to be at a nonoptimal value. Broadly speaking, if
 $Max Dual infeas / Max pi = 10-d ,$
then the objective function would probably change in the $d$th significant digit if optimization could be continued. If $d$ seems too large, consider restarting with a smaller ${\mathbf{Major Optimality Tolerance}}$.
Finally, Nonlinear constraint violn in the Print file shows the maximum infeasibility for nonlinear rows. If it seems too large, consider restarting with a smaller ${\mathbf{Major Feasibility Tolerance}}$.

## 6  Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
Internal error: memory allocation failed when attempting to allocate workspace sizes $〈\mathit{\text{value}}〉$, $〈\mathit{\text{value}}〉$ and $〈\mathit{\text{value}}〉$.
NE_ALLOC_INSUFFICIENT
NE_ARRAY_INPUT
Array element ${\mathbf{igfun}}\left[〈\mathit{\text{value}}〉\right]=〈\mathit{\text{value}}〉$ is out of range $1$ to ${\mathbf{nf}}=〈\mathit{\text{value}}〉$, or array element ${\mathbf{jgvar}}\left[〈\mathit{\text{value}}〉\right]=〈\mathit{\text{value}}〉$ is out of range $1$ to ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Basis file dimensions do not match this problem.
On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_BASIS_FAILURE
An error has occurred in the basis package. Check that arrays iafun, javar, igfun and jgvar contain values in the appropriate ranges and do not define duplicate elements of a or g. Set the optional argument ${\mathbf{Print File}}$ and examine the output carefully for further information.
NE_DERIV_ERRORS
User-supplied function computes incorrect constraint derivatives.
User-supplied function computes incorrect objective derivatives.
NE_E04VGC_NOT_INIT
Initialization function nag_opt_sparse_nlp_init (e04vgc) has not been called.
NE_INT
On entry, ${\mathbf{lena}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{lena}}\ge 1$.
On entry, ${\mathbf{leng}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{leng}}\ge 1$.
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}>0$.
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 1$.
On entry, ${\mathbf{nea}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nea}}\ge 0$.
On entry, ${\mathbf{neg}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{neg}}\ge 0$.
On entry, ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nf}}>0$.
On entry, ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nf}}\ge 1$.
NE_INT_2
On entry, ${\mathbf{nfname}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nfname}}=1\text{​ or ​}{\mathbf{nf}}$.
On entry, ${\mathbf{nxname}}=〈\mathit{\text{value}}〉$ and ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nxname}}=1\text{​ or ​}{\mathbf{n}}$.
On entry, ${\mathbf{objrow}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: $0\le {\mathbf{objrow}}\le {\mathbf{nf}}$.
On entry, one but not both of nxname and nfname is equal to $1$. ${\mathbf{nxname}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nfname}}=〈\mathit{\text{value}}〉$.
NE_INT_3
On entry, ${\mathbf{nea}}=〈\mathit{\text{value}}〉$, ${\mathbf{n}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nea}}\le {\mathbf{n}}×{\mathbf{nf}}$.
On entry, ${\mathbf{neg}}=〈\mathit{\text{value}}〉$, ${\mathbf{n}}=〈\mathit{\text{value}}〉$ and ${\mathbf{nf}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{neg}}\le {\mathbf{n}}×{\mathbf{nf}}$.
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.
An unexpected error has occurred. Set the optional argument ${\mathbf{Print File}}$ and examine the output carefully for further information.
NE_NOT_REQUIRED_ACC
The requested accuracy could not be achieved.
NE_NUM_DIFFICULTIES
Numerical difficulties have been encountered and no further progress can be made.
NE_REAL_2
On entry, bounds flow and fupp for $〈\mathit{\text{value}}〉$ are equal and infinite. ${\mathbf{flow}}={\mathbf{fupp}}=〈\mathit{\text{value}}〉$ and $\mathit{infbnd}=〈\mathit{\text{value}}〉$.
On entry, bounds flow and fupp for variable $〈\mathit{\text{value}}〉$ are equal and infinite. ${\mathbf{flow}}={\mathbf{fupp}}=〈\mathit{\text{value}}〉$ and $\mathit{infbnd}=〈\mathit{\text{value}}〉$.
On entry, bounds for $〈\mathit{\text{value}}〉$ are inconsistent. ${\mathbf{flow}}=〈\mathit{\text{value}}〉$ and ${\mathbf{fupp}}=〈\mathit{\text{value}}〉$.
On entry, bounds for $〈\mathit{\text{value}}〉$ are inconsistent. ${\mathbf{xlow}}=〈\mathit{\text{value}}〉$ and ${\mathbf{xupp}}=〈\mathit{\text{value}}〉$.
On entry, bounds for variable $〈\mathit{\text{value}}〉$ are inconsistent. ${\mathbf{flow}}=〈\mathit{\text{value}}〉$ and ${\mathbf{fupp}}=〈\mathit{\text{value}}〉$.
On entry, bounds for variable $〈\mathit{\text{value}}〉$ are inconsistent. ${\mathbf{xlow}}=〈\mathit{\text{value}}〉$ and ${\mathbf{xupp}}=〈\mathit{\text{value}}〉$.
On entry, bounds xlow and xupp for $〈\mathit{\text{value}}〉$ are equal and infinite. ${\mathbf{xlow}}={\mathbf{xupp}}=〈\mathit{\text{value}}〉$ and $\mathit{infbnd}=〈\mathit{\text{value}}〉$.
On entry, bounds xlow and xupp for variable $〈\mathit{\text{value}}〉$ are equal and infinite. ${\mathbf{xlow}}={\mathbf{xupp}}=〈\mathit{\text{value}}〉$ and $\mathit{infbnd}=〈\mathit{\text{value}}〉$.
NE_UNBOUNDED
The problem appears to be unbounded. The constraint violation limit has been reached.
The problem appears to be unbounded. The objective function is unbounded.
NE_USER_STOP
User-supplied function requested termination.
NE_USRFUN_UNDEFINED
Unable to proceed into undefined region of user-supplied function.
User-supplied function is undefined at the first feasible point.
User-supplied function is undefined at the initial point.
NW_LIMIT_REACHED
Iteration limit reached.
Major iteration limit reached.
The superbasics limit is too small.
NW_NOT_FEASIBLE
The linear constraints appear to be infeasible.
The problem appears to be infeasible. Infeasibilites have been minimized.
The problem appears to be infeasible. Nonlinear infeasibilites have been minimized.
The problem appears to be infeasible. The linear equality constraints could not be satisfied.

## 7  Accuracy

If the value of the optional argument ${\mathbf{Major Optimality Tolerance}}$ is set to ${10}^{-d}$ ($\text{default value}=\sqrt{\epsilon }$) and NE_NOERROR on exit, then the final value of $f\left(x\right)$ should have approximately $d$ correct significant digits.

This section describes the final output produced by nag_opt_sparse_nlp_solve (e04vhc). Intermediate and other output are given in Section 12.

### 8.1  The Final Output

Unless ${\mathbf{Print File}}=0$, the final output, including a listing of the status of every variable and constraint will be sent to the ${\mathbf{Print File}}$. The following describes the output for each constraint (row) and variable (column).

#### 8.1.1  The ROWS section

General linear constraints take the form $l\le {A}_{L}x\le u$. The $i$th constraint is therefore of the form
 $α≤ νix≤ β ,$
where ${\nu }_{i}$ is the $i$th row of ${A}_{L}$.
Internally, the constraints take the form ${A}_{L}x-s=0$, where $s$ is the set of slack variables (which satisfy the bounds $l\le s\le u$). For the $i$th row it is the slack variable ${s}_{i}$ that is directly available and it is sometimes convenient to refer to its state. Nonlinear constraints $\alpha \le {f}_{i}\left(x\right)+{\nu }_{i}x\le \beta$ are treated similarly, except that the row activity and degree of infeasibility are computed directly from ${f}_{i}\left(x\right)+{\nu }_{i}x$, rather than ${s}_{i}$.
A full stop (.) is printed for any numerical value that is exactly zero.
Label Description
Number is the value of $n+i$. (This is used internally to refer to ${s}_{i}$ in the intermediate output.)
Row gives the name of the $i$th row.
State the state of the $i$th row relative to the bounds $\alpha$ and $\beta$. The various states possible are as follows:
 LL the row is at its lower limit, $\alpha$. UL the row is at its upper limit, $\beta$. EQ the limits are the same ($\alpha =\beta$). FR ${s}_{i}$ is nonbasic and currently zero, even though it is free to take any value between its bounds $\alpha$ and $\beta$. BS ${s}_{i}$ is basic. SBS ${s}_{i}$ is superbasic.
A key is sometimes printed before State. Note that unless the optional argument ${\mathbf{Scale Option}}=0$ is specified, the tests for assigning a key are applied to the variables of the scaled problem.
 A Alternative optimum possible. The variable is nonbasic, but its reduced gradient is essentially zero. This means that if the variable were allowed to start moving away from its bound, there would be no change in the value of the objective function. The values of the other free variables might change, giving a genuine alternative solution. However, if there are any degenerate variables (labelled D), the actual change might prove to be zero, since one of them could encounter a bound immediately. In either case, the values of the Lagrange multipliers might also change. D Degenerate. The variable is basic or superbasic, but it is equal (or very close) to one of its bounds. I Infeasible. The variable is basic or superbasic and is currently violating one of its bounds by more than the value of the ${\mathbf{Feasibility Tolerance}}$. N Not precisely optimal. The variable is nonbasic or superbasic. If the value of the reduced gradient for the variable exceeds the value of the optional argument ${\mathbf{Major Optimality Tolerance}}$, the solution would not be declared optimal because the reduced gradient for the variable would not be considered negligible.
Activity is the value of ${\nu }_{i}x$ (or ${f}_{i}\left(x\right)+{\nu }_{i}x$ for nonlinear rows) at the final iterate.
Slack Activity is the value by which the row differs from its nearest bound. (For the free row (if any), it is set to Activity.)
Lower Limit is $\alpha$, the lower bound on the row.
Upper Limit is $\beta$, the upper bound on the row.
Dual Activity is the value of the dual variable ${\pi }_{i}$ (the Lagrange multiplier for the $i$th constraint). The full vector $\pi$ always satisfies ${B}^{\mathrm{T}}\pi ={g}_{B}$, where $B$ is the current basis matrix and ${g}_{B}$ contains the associated gradients for the current objective function. For FP problems, ${\pi }_{i}$ is set to zero.
i gives the index $i$ of the $i$th row.

#### 8.1.2  The COLUMNS section

Let the $j$th component of $x$ be the variable ${x}_{j}$ and assume that it satisfies the bounds $\alpha \le {x}_{j}\le \beta$. A fullstop (.) is printed for any numerical value that is exactly zero.
Label Description
Number is the column number $j$. (This is used internally to refer to ${x}_{j}$ in the intermediate output.)
Column gives the name of ${x}_{j}$.
State the state of ${x}_{j}$ relative to the bounds $\alpha$ and $\beta$. The various states possible are as follows:
 LL ${x}_{j}$ is nonbasic at its lower limit, $\alpha$. UL ${x}_{j}$ is nonbasic at its upper limit, $\beta$. EQ ${x}_{j}$ is nonbasic and fixed at the value $\alpha =\beta$. FR ${x}_{j}$ is nonbasic at some value strictly between its bounds: $\alpha <{x}_{j}<\beta$. BS ${x}_{j}$ is basic. Usually $\alpha <{x}_{j}<\beta$. SBS ${x}_{j}$ is superbasic. Usually $\alpha <{x}_{j}<\beta$.
A key is sometimes printed before State. Note that unless the optional argument ${\mathbf{Scale Option}}=0$ is specified, the tests for assigning a key are applied to the variables of the scaled problem.
 A Alternative optimum possible. The variable is nonbasic, but its reduced gradient is essentially zero. This means that if the variable were allowed to start moving away from its bound, there would be no change in the value of the objective function. The values of the other free variables might change, giving a genuine alternative solution. However, if there are any degenerate variables (labelled D), the actual change might prove to be zero, since one of them could encounter a bound immediately. In either case, the values of the Lagrange multipliers might also change. D Degenerate. The variable is basic or superbasic, but it is equal (or very close) to one of its bounds. I Infeasible. The variable is basic or superbasic and is currently violating one of its bounds by more than the value of the ${\mathbf{Feasibility Tolerance}}$. N Not precisely optimal. The variable is nonbasic or superbasic. If the value of the reduced gradient for the variable exceeds the value of the optional argument ${\mathbf{Major Optimality Tolerance}}$, the solution would not be declared optimal because the reduced gradient for the variable would not be considered negligible.
Activity is the value of ${x}_{j}$ at the final iterate.
Obj Gradient is the value of ${g}_{j}$ at the final iterate. For FP problems, ${g}_{j}$ is set to zero.
Lower Limit is the lower bound specified for the variable. None indicates that ${\mathbf{xlow}}\left[j-1\right]\le -\mathit{infbnd}$.
Upper Limit is the upper bound specified for the variable. None indicates that ${\mathbf{xupp}}\left[j-1\right]\ge \mathit{infbnd}$.
Reduced Gradnt is the value of the reduced gradient ${d}_{j}={g}_{j}-{\pi }^{\mathrm{T}}{a}_{j}$ where ${a}_{j}$ is the $j$th column of the constraint matrix. For FP problems, ${d}_{j}$ is set to zero.
m + j is the value of $m+j$.
Note that movement off a constraint (as opposed to a variable moving away from its bound) can be interpreted as allowing the entry in the Slack Activity column to become positive.
Numerical values are output with a fixed number of digits; they are not guaranteed to be accurate to this precision.

## 9  Example

This example is a reformulation of Problem 74 from Hock and Schittkowski (1981) and involves the minimization of the nonlinear function
 $fx=10-6x33+23×10-6x43+3x3+2x4$
subject to the bounds
 $-0.55≤x1≤ 0.55, -0.55≤x2≤ 0.55, - 0.00≤x3≤ 1200, - 0.00≤x4≤ 1200,$
to the nonlinear constraints
 $1000 sin -x1 -0.25 + 1000 sin -x2 -0.25 - x3 = -894.8, 1000sinx1-0.25+1000sinx1-x2-0.25-x4 = -894.8, 1000sinx2-0.25+1000sinx2-x1-0.25 = -1294.8,$
and to the linear constraints
 $-x1+x2≥-0.55, -x1-x2≥-0.55.$
The initial point, which is infeasible, is
 $x0 = 0, 0, 0, 0 T ,$
and $f\left({x}_{0}\right)=0$.
The optimal solution (to five figures) is
 $x*=0.11887,-0.39623,679.94,1026.0T,$
and $f\left({x}^{*}\right)=5126.4$. All the nonlinear constraints are active at the solution.
The example in the document for nag_opt_sparse_nlp_jacobian (e04vjc) solves the above problem. It first calls nag_opt_sparse_nlp_jacobian (e04vjc) to determine the sparsity pattern before calling nag_opt_sparse_nlp_solve (e04vhc).
The example in the document for nag_opt_sparse_nlp_option_set_file (e04vkc) solves the above problem using some of the optional arguments described in Section 11.
The formulation of the problem combines the constraints and the objective into a single vector ($F$) which is split into linear part (${A}_{L}x$) and a nonlinear part ($f$). For example we could write
 $F = 1000 sin -x1 - 0.25 + 1000 sin -x2 - 0.25 - x3 1000 sin x1 - 0.25 + 1000 sin x1 - x2 - 0.25 - x4 1000 sin x2 - 0.25 + 1000 sin x2 - x1 - 0.25 -x1 + x2 -x1 - x2 10-6 x33 + 23 × 10-6 x43 + 3x3 + 2x4 = f + AL x$
where
 $f = 1000 sin -x1 - 0.25 + 1000 sin -x2 - 0.25 1000 sin x1 - 0.25 + 1000 sin x1 - x2 - 0.25 1000 sin x2 - 0.25 + 1000 sin x2 - x1 - 0.25 0 0 10-6 x33 + 23 × 10-6 x43$
and
 $AL = 0 0 -1 0 0 0 0 -1 0 0 0 0 -1 1 0 0 1 -1 0 0 0 0 3 2 .$
The nonzero elements of ${A}_{L}$ need to be stored in the triples $\left({\mathbf{iafun}}\left[k-1\right],{\mathbf{javar}}\left[k-1\right],{\mathbf{a}}\left[k-1\right]\right)$ in any order. For example
 $k$ $1$ $2$ $3$ $4$ $5$ $6$ $7$ $8$ ${\mathbf{iafun}}\left[k-1\right]$ $1$ $2$ $4$ $4$ $5$ $5$ $6$ $6$ ${\mathbf{javar}}\left[k-1\right]$ $3$ $4$ $1$ $2$ $1$ $2$ $3$ $4$ ${\mathbf{a}}\left[k-1\right]$ $-1$ $-1$ $-1$ $1$ $1$ $-1$ $3$ $2$
The nonlinear functions $f$ and the Jacobian need to be supplied in usrfun. Please note that there is no need to assign any value to ${f}_{4}$ or ${f}_{5}$ as there is no nonlinear part in ${F}_{4}$ or ${F}_{5}$.
The nonzero entries of the Jacobian of $f$ are
 $∂f1 ∂x1 = -1000 cos -x1 - 0.25 ∂f1 ∂x2 = -1000 cos -x2 - 0.25 ∂f2 ∂x1 = 1000 cos x1 - 0.25 + 1000 cos x1 - x2 - 0.25 ∂f2 ∂x2 = -1000 cos x1 - x2 - 0.25 ∂f3 ∂x1 = -1000 cos x2 - x1 - 0.25 ∂f3 ∂x2 = 1000 cos x2 - 0.25 + 1000 cos x2 - x1 - 0.25 ∂f6 ∂x3 = 3×10 -6 x32 ∂f6 ∂x4 = 2×10 -6 x42$
So the arrays igfun and jgvar must contain:
 $k$ $1$ $2$ $3$ $4$ $5$ $6$ $7$ $8$ ${\mathbf{igfun}}\left[k-1\right]$ $1$ $1$ $2$ $2$ $3$ $3$ $6$ $6$ ${\mathbf{jgvar}}\left[k-1\right]$ $1$ $2$ $1$ $2$ $1$ $2$ $3$ $4$
and usrfun must return in ${\mathbf{g}}\left[k-1\right]$ the value of $\frac{\partial {f}_{i}}{\partial {x}_{j}}$, where $i={\mathbf{igfun}}\left[k-1\right]$ and $j={\mathbf{jgvar}}\left[k-1\right]$.

### 9.1  Program Text

Program Text (e04vhce.c)

### 9.2  Program Data

Program Data (e04vhce.d)

### 9.3  Program Results

Program Results (e04vhce.r)

Note: the remainder of this document is intended for more advanced users. Section 10 contains a detailed description of the algorithm which may be needed in order to understand Sections 11 and 12. Section 11 describes the optional arguments which may be set by calls to nag_opt_sparse_nlp_option_set_file (e04vkc), nag_opt_sparse_nlp_option_set_string (e04vlc), nag_opt_sparse_nlp_option_set_integer (e04vmc) and/or nag_opt_sparse_nlp_option_set_double (e04vnc). Section 12 describes the quantities which can be requested to monitor the course of the computation.

## 10  Algorithmic Details

Here we summarize the main features of the SQP algorithm used in nag_opt_sparse_nlp_solve (e04vhc) and introduce some terminology used in the description of the function and its arguments. The SQP algorithm is fully described in Gill et al. (2002).

### 10.1  Constraints and Slack Variables

Problem (1) contains $n$ variables in $x$. Let $m$ be the number of components of $f\left(x\right)$ and ${A}_{L}x$ combined. The upper and lower bounds on those terms define the general constraints of the problem. nag_opt_sparse_nlp_solve (e04vhc) converts the general constraints to equalities by introducing a set of slack variables $s={\left({s}_{1},{s}_{2},\dots ,{s}_{m}\right)}^{\mathrm{T}}$. For example, the linear constraint $5\le 2{x}_{1}+3{x}_{2}\le \infty$ is replaced by $2{x}_{1}+3{x}_{2}-{s}_{1}=0$ together with the bounded slack $5\le {s}_{1}\le \infty$. The minimization problem (1) can therefore be written in the equivalent form
 $minimize x,s f0x subject to ​ fx ALx - s = 0 , l ≤ x s ≤ u .$ (3)
The general constraints become the equalities $f\left(x\right)-{s}_{N}=0$ and ${A}_{L}x-{s}_{L}=0$, where ${s}_{L}$ and ${s}_{N}$ are the linear and nonlinear slacks.

### 10.2  Major Iterations

The basic structure of the SQP algorithm involves major and minor iterations. The major iterations generate a sequence of iterates $\left\{{x}_{k}\right\}$ that satisfy the linear constraints and converge to a point that satisfies the nonlinear constraints and the first-order conditions for optimality. At each iterate ${x}_{k}$ a QP subproblem is used to generate a search direction towards the next iterate ${x}_{k+1}$. The constraints of the subproblem are formed from the linear constraints ${A}_{L}x-{s}_{L}=0$ and the linearized constraint
 $fxk + f′ xk x-xk - sN = 0 ,$ (4)
where ${f}^{\prime }\left({x}_{k}\right)$ denotes the Jacobian matrix, whose elements are the first derivatives of $f\left(x\right)$ evaluated at ${x}_{k}$. The QP constraints therefore comprise the $m$ linear constraints
 $f′ xk x - sN = -fxk + f′ xk xk , ALx -sN - sL = 0 ,$ (5)
where $x$ and $s$ are bounded above and below by $u$ and $l$ as before. If the $m$ by $n$ matrix $A$ and $m$-vector $b$ are defined as
 $A = f′ xk AL and b = -fxk + f′ xk xk 0 ,$ (6)
then the QP subproblem can be written as
 $minimize x,s qx,xk = gkT x-xk + 12 x-xkT Hk x-xk subject to ​ Ax - s = b , l ≤ x s ≤ u ,$ (7)
where $q\left(x,{x}_{k}\right)$ is a quadratic approximation to a modified Lagrangian function (see Gill et al. (2002)). The matrix ${H}_{k}$ is a quasi-Newton approximation to the Hessian of the Lagrangian. A BFGS update is applied after each major iteration. If some of the variables enter the Lagrangian linearly the Hessian will have some zero rows and columns. If the nonlinear variables appear first, then only the ${n}_{1}$ rows and columns of the Hessian need to be approximated, where ${n}_{1}$ is the number of nonlinear variables. This quantity is determined by the implicit values of the number of nonlinear objective and Jacobian variables determined after the constraints and variables are reordered.

### 10.3  Minor Iterations

Solving the QP subproblem is itself an iterative procedure. Here, the iterations of the QP solver nag_opt_sparse_convex_qp_solve (e04nqc) form the minor iterations of the SQP method. nag_opt_sparse_convex_qp_solve (e04nqc) uses a reduced-Hessian active-set method implemented as a reduced-gradient method. At each minor iteration, the constraints $Ax-s=b$ are partitioned into the form
 $BxB + SxS + NxN = b ,$ (8)
where the basis matrix $B$ is square and nonsingular, and the matrices $S$ and $N$ are the remaining columns of $\left(\begin{array}{cc}A& -I\end{array}\right)$. The vectors ${x}_{B}$, ${x}_{S}$ and ${x}_{N}$ are the associated basic, superbasic and nonbasic variables respectively; they are a permutation of the elements of $x$ and $s$. At a QP subproblem, the basic and superbasic variables will lie somewhere between their bounds, while the nonbasic variables will normally be equal to one of their bounds. At each iteration, ${x}_{S}$ is regarded as a set of independent variables that are free to move in any desired direction, namely one that will improve the value of the QP objective (or the sum of infeasibilities). The basic variables are then adjusted in order to ensure that $\left(x,s\right)$ continues to satisfy $Ax-s=b$. The number of superbasic variables (${n}_{S}$, say) therefore indicates the number of degrees of freedom remaining after the constraints have been satisfied. In broad terms, ${n}_{S}$ is a measure of how nonlinear the problem is. In particular, ${n}_{S}$ will always be zero for LP problems.
If it appears that no improvement can be made with the current definition of $B$, $S$ and $N$, a nonbasic variable is selected to be added to $S$, and the process is repeated with the value of ${n}_{S}$ increased by one. At all stages, if a basic or superbasic variable encounters one of its bounds, the variable is made nonbasic and the value of ${n}_{S}$ is decreased by one.
Associated with each of the $m$ equality constraints $Ax-s=b$ are the dual variables $\pi$. Similarly, each variable in $\left(x,s\right)$ has an associated reduced gradient ${d}_{j}$. The reduced gradients for the variables $x$ are the quantities $g-{A}^{\mathrm{T}}\pi$, where $g$ is the gradient of the QP objective, and the reduced gradients for the slacks are the dual variables $\pi$. The QP subproblem is optimal if ${d}_{j}\ge 0$ for all nonbasic variables at their lower bounds, ${d}_{j}\le 0$ for all nonbasic variables at their upper bounds, and ${d}_{j}=0$ for other variables, including superbasics. In practice, an approximate QP solution $\left({\stackrel{^}{x}}_{k},{\stackrel{^}{s}}_{k},{\stackrel{^}{\pi }}_{k}\right)$ is found by relaxing these conditions.

### 10.4  The Merit Function

After a QP subproblem has been solved, new estimates of the solution are computed using a linesearch on the augmented Lagrangian merit function
 $M x,s,π = f0x - πT fx - sN + 12 fx - sN T D fx - sN ,$ (9)
where $D$ is a diagonal matrix of penalty arguments $\left({D}_{ii}\ge 0\right)$, and $\pi$ now refers to dual variables for the nonlinear constraints in (1). If $\left({x}_{k},{s}_{k},{\pi }_{k}\right)$ denotes the current solution estimate and $\left({\stackrel{^}{x}}_{k},{\stackrel{^}{s}}_{k},{\stackrel{^}{\pi }}_{k}\right)$ denotes the QP solution, the linesearch determines a step ${\alpha }_{k}$ $\left(0<{\alpha }_{k}\le 1\right)$ such that the new point
 $xk+1 sk+1 πk+1 = xk sk πk + αk x^k - xk s^k - sk π^k - πk$ (10)
gives a sufficient decrease in the merit function $\mathcal{M}$. When necessary, the penalties in $D$ are increased by the minimum-norm perturbation that ensures descent for $\mathcal{M}$ (see Gill et al. (1992)). The value of ${s}_{N}$ is adjusted to minimize the merit function as a function of $s$ before the solution of the QP subproblem (see Gill et al. (1986) and Eldersveld (1991)).

### 10.5  Treatment of Constraint Infeasibilities

nag_opt_sparse_nlp_solve (e04vhc) makes explicit allowance for infeasible constraints. First, infeasible linear constraints are detected by solving the linear program
 $minimize x,v,w eT v+w subject to ​ l ≤ x ALx - v + w ≤ u , v≥0 , w≥0 ,$ (11)
where $e$ is a vector of ones, and the nonlinear constraint bounds are temporarily excluded from $l$ and $u$. This is equivalent to minimizing the sum of the general linear constraint violations subject to the bounds on $x$. (The sum is the ${\ell }_{1}$-norm of the linear constraint violations. In the linear programming literature, the approach is called elastic programming.)
The linear constraints are infeasible if the optimal solution of (11) has $v\ne 0$ or $w\ne 0$. nag_opt_sparse_nlp_solve (e04vhc) then terminates without computing the nonlinear functions.
Otherwise, all subsequent iterates satisfy the linear constraints. (Such a strategy allows linear constraints to be used to define a region in which the functions can be safely evaluated.) nag_opt_sparse_nlp_solve (e04vhc) proceeds to solve nonlinear problems as given, using search directions obtained from the sequence of QP subproblems (see (7)).
If a QP subproblem proves to be infeasible or unbounded (or if the dual variables $\pi$ for the nonlinear constraints become large), nag_opt_sparse_nlp_solve (e04vhc) enters ‘elastic’ mode and thereafter solves the problem
 $minimize x,v,w f0x + γ eT v+w subject to ​ l ≤ x fx - v + w ALx ≤ u , v≥0 , w≥0 ,$ (12)
where $\gamma$ is a non-negative argument (the elastic weight), and ${f}_{0}\left(x\right)+\gamma {e}^{\mathrm{T}}\left(v+w\right)$ is called a composite objective (the ${\ell }_{1}$ penalty function for the nonlinear constraints).
The value of $\gamma$ may increase automatically by multiples of $10$ if the optimal $v$ and $w$ continue to be nonzero. If $\gamma$ is sufficiently large, this is equivalent to minimizing the sum of the nonlinear constraint violations subject to the linear constraints and bounds.
The initial value of $\gamma$ is controlled by the optional argument ${\mathbf{Elastic Weight}}$.

## 11  Optional Arguments

Several optional arguments in nag_opt_sparse_nlp_solve (e04vhc) define choices in the problem specification or the algorithm logic. In order to reduce the number of formal arguments of nag_opt_sparse_nlp_solve (e04vhc) these optional arguments have associated default values that are appropriate for most problems. Therefore, you need only specify those optional arguments 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 arguments. The following is a list of the optional arguments available and a full description of each optional argument is provided in Section 11.1.
Optional arguments may be specified by calling one, or more, of the functions nag_opt_sparse_nlp_option_set_file (e04vkc), nag_opt_sparse_nlp_option_set_string (e04vlc), nag_opt_sparse_nlp_option_set_integer (e04vmc) and nag_opt_sparse_nlp_option_set_double (e04vnc) before a call to nag_opt_sparse_nlp_solve (e04vhc).
nag_opt_sparse_nlp_option_set_file (e04vkc) reads options from an external options file, with Begin and End as the first and last lines respectively and each intermediate line defining a single optional argument. For example,
```Begin
Print Level = 5
End
```
The call
```e04vkc (ioptns, &state, &fail);
```
can then be used to read the file on file descriptor ioptns which can be obtained by a prior call to nag_open_file (x04acc). NE_NOERROR on successful exit. nag_opt_sparse_nlp_option_set_file (e04vkc) should be consulted for a full description of this method of supplying optional arguments.
nag_opt_sparse_nlp_option_set_string (e04vlc), nag_opt_sparse_nlp_option_set_integer (e04vmc) and nag_opt_sparse_nlp_option_set_double (e04vnc) can be called to supply options directly, one call being necessary for each optional argument. For example,
```e04vlc ("Print Level = 5", &state, &fail);
```
nag_opt_sparse_nlp_option_set_string (e04vlc), nag_opt_sparse_nlp_option_set_integer (e04vmc) and nag_opt_sparse_nlp_option_set_double (e04vnc) should be consulted for a full description of this method of supplying optional arguments.
All optional arguments you do not specify are set to their default values. Optional arguments you specify are unaltered by nag_opt_sparse_nlp_solve (e04vhc) (unless they define invalid values) and so remain in effect for subsequent calls to nag_opt_sparse_nlp_solve (e04vhc), unless you alter them.

### 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, 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 $a$, $i\text{​ and ​}r$ denote options that take character, integer and real values respectively;
• the default value, where the symbol $\epsilon$ is a generic notation for machine precision (see nag_machine_precision (X02AJC)), and ${\epsilon }_{r}$ denotes the relative precision of the objective function ${\mathbf{Function Precision}}$, and $\mathit{bigbnd}$ signifies the value of ${\mathbf{Infinite Bound Size}}$.
Keywords and character values are case and white space insensitive.
Optional arguments used to specify files (e.g., optional arguments ${\mathbf{Dump File}}$ and ${\mathbf{Print File}}$) have type Nag_FileID (see Section 3.2.1.1 in the Essential Introduction). This ID value must either be set to $0$ (the default value) in which case there will be no output, or will be as returned by a call of nag_open_file (x04acc).
 Central Difference Interval $r$ Default $\text{}={\epsilon }_{r}^{\frac{1}{3}}$
When ${\mathbf{Derivative Option}}=0$, the central-difference interval $r$ is used near an optimal solution to obtain more accurate (but more expensive) estimates of gradients. Twice as many function evaluations are required compared to forward differencing. The interval used for the $j$th variable is ${h}_{j}=r\left(1+\left|{x}_{j}\right|\right)$. The resulting derivative estimates should be accurate to $\mathit{O}\left({r}^{2}\right)$, unless the functions are badly scaled.
If you supply a value for this optional parameter, a small value between $0.0$ and $1.0$ is appropriate.
 Check Frequency $i$ Default $\text{}=60$
Every $i$th minor iteration after the most recent basis factorization, a numerical test is made to see if the current solution $x$ satisfies the general linear constraints (the linear constraints and the linearized nonlinear constraints, if any). The constraints are of the form $Ax-s=b$, where $s$ is the set of slack variables. To perform the numerical test, the residual vector $r=b-Ax+s$ is computed. If the largest component of $r$ is judged to be too large, the current basis is refactorized and the basic variables are recomputed to satisfy the general constraints more accurately. If $i\le 0$, the value of $i=99999999$ is used and effectively no checks are made.
${\mathbf{Check Frequency}}=1$ is useful for debugging purposes, but otherwise this option should not be needed.
 Crash Option $i$ Default $\text{}=3$
 Crash Tolerance $r$ Default $\text{}=0.1$
Except on restarts, an internal Crash procedure is used to select an initial basis from certain rows and columns of the constraint matrix $\left(\begin{array}{cc}A& -I\end{array}\right)$. The ${\mathbf{Crash Option}}$ $i$ determines which rows and columns of $A$ are eligible initially, and how many times the Crash procedure is called. Columns of $-I$ are used to pad the basis where necessary.
 $i$ Meaning $0$ The initial basis contains only slack variables: $B=I$. $1$ The Crash procedure is called once, looking for a triangular basis in all rows and columns of $A$. $2$ The Crash procedure is called twice (if there are nonlinear constraints). The first call looks for a triangular basis in linear rows, and the iteration proceeds with simplex iterations until the linear constraints are satisfied. The Jacobian is then evaluated for the first major iteration and the Crash procedure is called again to find a triangular basis in the nonlinear rows (retaining the current basis for linear rows). $3$ The Crash procedure is called up to three times (if there are nonlinear constraints). The first two calls treat linear equalities and linear inequalities separately. As before, the last call treats nonlinear rows before the first major iteration.
If $i\ge 1$, certain slacks on inequality rows are selected for the basis first. (If $i\ge 2$, numerical values are used to exclude slacks that are close to a bound). The Crash procedure then makes several passes through the columns of $A$, searching for a basis matrix that is essentially triangular. A column is assigned to ‘pivot’ on a particular row if the column contains a suitably large element in a row that has not yet been assigned. (The pivot elements ultimately form the diagonals of the triangular basis.) For remaining unassigned rows, slack variables are inserted to complete the basis.
The ${\mathbf{Crash Tolerance}}$ $r$ allows the starting Crash procedure to ignore certain ‘small’ nonzeros in each column of $A$. If ${a}_{\mathrm{max}}$ is the largest element in column $j$, other nonzeros of ${a}_{ij}$ in the columns are ignored if $\left|{a}_{ij}\right|\le {a}_{\mathrm{max}}×r$. (To be meaningful, $r$ should be in the range $0\le r<1$.)
When $r>0.0$, the basis obtained by the Crash procedure may not be strictly triangular, but it is likely to be nonsingular and almost triangular. The intention is to obtain a starting basis containing more columns of $A$ and fewer (arbitrary) slacks. A feasible solution may be reached sooner on some problems.
For example, suppose the first $m$ columns of $A$ form the matrix shown under ${\mathbf{LU Factor Tolerance}}$; i.e., a tridiagonal matrix with entries $-1$, $4$, $-1$. To help the Crash procedure choose all $m$ columns for the initial basis, we would specify a ${\mathbf{Crash Tolerance}}$ of $r$ for some value of $r>0.5$.
 Defaults
This special keyword may be used to reset all optional arguments to their default values.
 Derivative Option $i$ Default $\text{}=1$
Optional argument ${\mathbf{Derivative Option}}$ specifies which nonlinear function gradients are known analytically and will be supplied to nag_opt_sparse_nlp_solve (e04vhc) by usrfun.
 $i$ Meaning $0$ Some problem derivatives are unknown. $1$ All problem derivatives are known.
The value $i=1$ should be used whenever possible. It is the most reliable and will usually be the most efficient.
If $i=0$, nag_opt_sparse_nlp_solve (e04vhc) will estimate the missing components of $G\left(x\right)$ using finite differences. This may simplify the coding of usrfun. However, it could increase the total run-time substantially (since a special call to usrfun is required for each column of the Jacobian that has a missing element), and there is less assurance that an acceptable solution will be located. If the nonlinear variables are not well scaled, it may be necessary to specify a nonstandard optional argument ${\mathbf{Difference Interval}}$.
For each column of the Jacobian, one call to usrfun is needed to estimate all missing elements in that column, if any.
At times, central differences are used rather than forward differences. Twice as many calls to usrfun are needed. (This is not under your control.)
 Derivative Linesearch Default
 Nonderivative Linesearch
At each major iteration a linesearch is used to improve the merit function. Optional argument ${\mathbf{Derivative Linesearch}}$ uses safeguarded cubic interpolation and requires both function and gradient values to compute estimates of the step ${\alpha }_{k}$. If some analytic derivatives are not provided, or optional argument ${\mathbf{Nonderivative Linesearch}}$ is specified, nag_opt_sparse_nlp_solve (e04vhc) employs a linesearch based upon safeguarded quadratic interpolation, which does not require gradient evaluations.
A nonderivative linesearch can be slightly less robust on difficult problems, and it is recommended that the default be used if the functions and derivatives can be computed at approximately the same cost. If the gradients are very expensive relative to the functions, a nonderivative linesearch may give a significant decrease in computation time.
If ${\mathbf{Nonderivative Linesearch}}$ is selected, nag_opt_sparse_nlp_solve (e04vhc) signals the evaluation of the linesearch by calling usrfun with ${\mathbf{needg}}=0$. Once the linesearch is completed, the problem functions are called again with ${\mathbf{needf}}=0$ and ${\mathbf{needg}}=0$. If the potential saving provided by a nonderivative linesearch is to be realised, it is essential that usrfun be coded so that derivatives are not computed when ${\mathbf{needg}}=0$.
 Difference Interval $r$ Default $\text{}=\sqrt{{\epsilon }_{r}}$
This alters the interval $r$ used to estimate gradients by forward differences. It does so in the following circumstances:
 – in the interval (‘cheap’) phase of verifying the problem derivatives; – for verifying the problem derivatives; – for estimating missing derivatives.
In all cases, a derivative with respect to ${x}_{j}$ is estimated by perturbing that component of $x$ to the value ${x}_{j}+r\left(1+\left|{x}_{j}\right|\right)$, and then evaluating ${F}_{\mathrm{obj}}\left(x\right)$ or $f\left(x\right)$ at the perturbed point. The resulting gradient estimates should be accurate to $\mathit{O}\left(r\right)$ unless the functions are badly scaled. Judicious alteration of $r$ may sometimes lead to greater accuracy.
If you supply a value for this optional parameter, a small value between $0.0$ and $1.0$ is appropriate.
 Dump File ${i}_{1}$ Default $\text{}=0$
 Load File ${i}_{2}$ Default $\text{}=0$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
Optional arguments ${\mathbf{Dump File}}$ and ${\mathbf{Load File}}$ are similar to optional arguments ${\mathbf{Punch File}}$ and ${\mathbf{Insert File}}$, but they record solution information in a manner that is more direct and more easily modified. A full description of information recorded in optional arguments ${\mathbf{Dump File}}$ and ${\mathbf{Load File}}$ is given in Gill et al. (2005a).
If ${\mathbf{Dump File}}>0$, the last solution obtained will be output to the file associated with ID ${i}_{1}$.
If ${\mathbf{Load File}}>0$, the file associated with ID ${i}_{2}$, containing basis information, will be read. The file will usually have been output previously as a ${\mathbf{Dump File}}$. The file will not be accessed if optional arguments ${\mathbf{Old Basis File}}$ or ${\mathbf{Insert File}}$ are specified.
 Elastic Weight $r$ Default $\text{}={10}^{4}$
This keyword determines the initial weight $\gamma$ associated with the problem (12) (see Section 10.5).
At major iteration $k$, if elastic mode has not yet started, a scale factor ${\sigma }_{k}=1+{‖g\left({x}_{k}\right)‖}_{\infty }$ is defined from the current objective gradient. Elastic mode is then started if the QP subproblem is infeasible, or the QP dual variables are larger in magnitude than ${\sigma }_{k}\text{}r$. The QP is resolved in elastic mode with $\gamma ={\sigma }_{k}\text{}r$.
Thereafter, major iterations continue in elastic mode until they converge to a point that is optimal for (12) (see Section 10.5). If the point is feasible for equation (1) $\left(v=w=0\right)$, it is declared locally optimal. Otherwise, $\gamma$ is increased by a factor of $10$ and major iterations continue. If $\gamma$ has already reached a maximum allowable value, equation (1) is declared locally infeasible.
 Expand Frequency $i$ Default $\text{}=10000$
This option is part of the anti-cycling procedure designed to make progress even on highly degenerate problems.
For linear models, the strategy is to force a positive step at every iteration, at the expense of violating the bounds on the variables by a small amount. Suppose that the optional argument ${\mathbf{Minor Feasibility Tolerance}}$ is $\delta$. Over a period of $i$ iterations, the tolerance actually used by nag_opt_sparse_nlp_solve (e04vhc) increases from $0.5\delta$ to $\delta$ (in steps of $0.5\delta /i$).
For nonlinear models, the same procedure is used for iterations in which there is only one superbasic variable. (Cycling can occur only when the current solution is at a vertex of the feasible region.) Thus, zero steps are allowed if there is more than one superbasic variable, but otherwise positive steps are enforced.
Increasing $i$ helps reduce the number of slightly infeasible nonbasic variables (most of which are eliminated during a resetting procedure). However, it also diminishes the freedom to choose a large pivot element (see optional argument ${\mathbf{Pivot Tolerance}}$).
 Factorization Frequency $i$ Default $\text{}=50$
At most $i$ basis changes will occur between factorizations of the basis matrix.
With linear programs, the basis factors are usually updated every iteration. The default $i$ is reasonable for typical problems. Higher values up to $i=100$ (say) may be more efficient on well-scaled problems.
When the objective function is nonlinear, fewer basis updates will occur as an optimum is approached. The number of iterations between basis factorizations will therefore increase. During these iterations a test is made regularly (according to the optional argument ${\mathbf{Check Frequency}}$) to ensure that the general constraints are satisfied. If necessary the basis will be refactorized before the limit of $i$ updates is reached.
 Function Precision $r$ Default $\text{}={\epsilon }^{0.8}$
The relative function precision ${\epsilon }_{r}$ is intended to be a measure of the relative accuracy with which the nonlinear functions can be computed. For example, if $f\left(x\right)$ is computed as $1000.56789$ for some relevant $x$ and if the first $6$ significant digits are known to be correct, the appropriate value for ${\epsilon }_{r}$ would be $\text{1.0e−6}$.
Ideally the functions ${f}_{i}\left(x\right)$ should have magnitude of order $1$. If all functions are substantially less than $1$ in magnitude, ${\epsilon }_{r}$ should be the absolute precision. For example, if $f\left(x\right)=\text{1.23456789e−4}$ at some point and if the first $6$ significant digits are known to be correct, the appropriate value for ${\epsilon }_{r}$ would be $\text{1.0e−10}$.)
The default value of ${\epsilon }_{r}$ is appropriate for simple analytic functions.
In some cases the function values will be the result of extensive computation, possibly involving a costly iterative procedure that can provide few digits of precision. Specifying an appropriate ${\mathbf{Function Precision}}$ may lead to savings, by allowing the linesearch procedure to terminate when the difference between function values along the search direction becomes as small as the absolute error in the values.
 Hessian Full Memory Default if ${n}_{1}\le 75$
 Hessian Limited Memory Default if ${n}_{1}>75$
These options select the method for storing and updating the approximate Hessian. (nag_opt_sparse_nlp_solve (e04vhc) uses a quasi-Newton approximation to the Hessian of the Lagrangian. A BFGS update is applied after each major iteration.)
If ${\mathbf{Hessian Full Memory}}$ is specified, the approximate Hessian is treated as a dense matrix and the BFGS updates are applied explicitly. This option is most efficient when the number of variables $n$ is not too large (say, less than $75$). In this case, the storage requirement is fixed and one can expect $1$-step Q-superlinear convergence to the solution.
${\mathbf{Hessian Limited Memory}}$ should be used on problems where $n$ is very large. In this case a limited-memory procedure is used to update a diagonal Hessian approximation ${H}_{r}$ a limited number of times. (Updates are accumulated as a list of vector pairs. They are discarded at regular intervals after ${H}_{r}$ has been reset to their diagonal.)
 Hessian Frequency $i$ Default $\text{}=99999999$
If optional argument ${\mathbf{Hessian Full Memory}}$ is in effect and $i$ BFGS updates have already been carried out, the Hessian approximation is reset to the identity matrix. (For certain problems, occasional resets may improve convergence, but in general they should not be necessary.)
${\mathbf{Hessian Full Memory}}$ and ${\mathbf{Hessian Frequency}}=10$ have a similar effect to ${\mathbf{Hessian Limited Memory}}$ and ${\mathbf{Hessian Updates}}=10$ (except that the latter retains the current diagonal during resets).
 Hessian Updates $i$ Default $\text{}={\mathbf{Hessian Frequency}}$ if ${\mathbf{Hessian Full Memory}}$, $10$ otherwise
If optional argument ${\mathbf{Hessian Limited Memory}}$ is in effect and $i$ BFGS updates have already been carried out, all but the diagonal elements of the accumulated updates are discarded and the updating process starts again.
Broadly speaking, the more updates stored, the better the quality of the approximate Hessian. However, the more vectors stored, the greater the cost of each QP iteration. The default value is likely to give a robust algorithm without significant expense, but faster convergence can sometimes be obtained with significantly fewer updates (e.g., $i=5$).
 Infinite Bound Size $r$ Default $\text{}={10}^{20}$
If $r\ge 0$, $r$ defines the ‘infinite’ bound $\mathit{bigbnd}$ in the definition of the problem constraints. Any upper bound greater than or equal to $\mathit{bigbnd}$ will be regarded as $+\infty$ (and similarly any lower bound less than or equal to $-\mathit{bigbnd}$ will be regarded as $-\infty$). If $r<0$, the default value is used.
 Iterations Limit $i$ Default $\text{}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(10000,10\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{n}},{\mathbf{nf}}\right)\right)$
The value of $i$ specifies the maximum number of minor iterations allowed (i.e., iterations of the simplex method or the QP algorithm), summed over all major iterations. (See also the description of the optional argument ${\mathbf{Minor Iterations Limit}}$.)
 Linesearch Tolerance $r$ Default $=0.9$
This tolerance, $r$, controls the accuracy with which a step length will be located along the direction of search each iteration. At the start of each linesearch a target directional derivative for the merit function is identified. This argument determines the accuracy to which this target value is approximated, and it must be a value in the range $0.0\le r\le 1.0$.
The default value $r=0.9$ requests just moderate accuracy in the linesearch.
If the nonlinear functions are cheap to evaluate, a more accurate search may be appropriate; try $r=0.1\text{, ​}0.01\text{​ or ​}0.001$.
If the nonlinear functions are expensive to evaluate, a less accurate search may be appropriate. If all gradients are known, try $r=0.99$. (The number of major iterations might increase, but the total number of function evaluations may decrease enough to compensate.)
If not all gradients are known, a moderately accurate search remains appropriate. Each search will require only $1$–5 function values (typically), but many function calls will then be needed to estimate missing gradients for the next iteration.
 LU Density Tolerance ${r}_{1}$ Default $\text{}=0.6$
 LU Singularity Tolerance ${r}_{2}$ Default $\text{}={\epsilon }^{\frac{2}{3}}$
The density tolerance, ${r}_{1}$, is used during $LU$ factorization of the basis matrix $B$. Columns of $L$ and rows of $U$ are formed one at a time, and the remaining rows and columns of the basis are altered appropriately. At any stage, if the density of the remaining matrix exceeds ${r}_{1}$, the Markowitz strategy for choosing pivots is terminated, and the remaining matrix is factored by a dense $LU$ procedure. Raising the density tolerance towards $1.0$ may give slightly sparser $LU$ factors, with a slight increase in factorization time.
The singularity tolerance, ${r}_{2}$, helps guard against ill-conditioned basis matrices. After $B$ is refactorized, the diagonal elements of $U$ are tested as follows: if $\left|{u}_{jj}\right|\le {r}_{2}$ or $\left|{u}_{jj}\right|<{r}_{2}\underset{i}{\mathrm{max}}\phantom{\rule{0.25em}{0ex}}\left|{u}_{ij}\right|$, the $j$th column of the basis is replaced by the corresponding slack variable. (This is most likely to occur after a restart.)
 LU Factor Tolerance ${r}_{1}$ Default $\text{}=3.99$
 LU Update Tolerance ${r}_{2}$ Default $\text{}=3.99$
The values of ${r}_{1}$ and ${r}_{2}$ affect the stability of the basis factorization $B=LU$, during refactorization and updates respectively. The lower triangular matrix $L$ is a product of matrices of the form
 $1 0 μ 1$
where the multipliers $\mu$ will satisfy $\left|\mu \right|\le {r}_{i}$. The default values of ${r}_{1}$ and ${r}_{2}$ usually strike a good compromise between stability and sparsity. They must satisfy ${r}_{1}$, ${r}_{2}\ge 1.0$.
For large and relatively dense problems, ${r}_{1}=10.0\text{​ or ​}5.0$ (say) may give a useful improvement in stability without impairing sparsity to a serious degree.
For certain very regular structures (e.g., band matrices) it may be necessary to reduce ${r}_{1}\text{​ and/or ​}{r}_{2}$ in order to achieve stability. For example, if the columns of $A$ include a sub-matrix of the form
 $4 -1 -1 4 -1 -1 4 -1 … … … -1 4 -1 -1 4 ,$
one should set both ${r}_{1}$ and ${r}_{2}$ to values in the range $1.0\le {r}_{i}<4.0$.
 LU Partial Pivoting Default
 LU Complete Pivoting
 LU Rook Pivoting
The $LU$ factorization implements a Markowitz-type search for pivots that locally minimize the fill-in subject to a threshold pivoting stability criterion. The default option is to use threshhold partial pivoting. The optional arguments ${\mathbf{LU Rook Pivoting}}$ and ${\mathbf{LU Complete Pivoting}}$ are more expensive than partial pivoting but are more stable and better at revealing rank, as long as ${\mathbf{LU Factor Tolerance}}$ is not too large (say $<2.0$). When numerical difficulties are encountered, nag_opt_sparse_nlp_solve (e04vhc) automatically reduces the $LU$ tolerance towards $1.0$ and switches (if necessary) to rook or complete pivoting, before reverting to the default or specified options at the next refactorization (with ${\mathbf{System Information Yes}}$, relevant messages are output to the ${\mathbf{Print File}}$).
 Major Feasibility Tolerance $r$ Default $\text{}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({10}^{-6},\sqrt{\epsilon }\right)$
This tolerance, $r$, specifies how accurately the nonlinear constraints should be satisfied. The default value is appropriate when the linear and nonlinear constraints contain data to about that accuracy.
Let ${v}_{\mathrm{max}}$ be the maximum nonlinear constraint violation, normalized by the size of the solution, which is required to satisfy
 $vmax=maxi vi ​ ​/​ ​ x ≤ r ,$ (13)
where ${v}_{\mathit{i}}$ is the violation of the $\mathit{i}$th nonlinear constraint, for $\mathit{i}=1,2,\dots ,{\mathbf{nf}}$.
In the major iteration log (see Section 12.2), ${v}_{\mathrm{max}}$ appears as the quantity labelled ‘Feasible’. If some of the problem functions are known to be of low accuracy, a larger ${\mathbf{Major Feasibility Tolerance}}$ may be appropriate.
 Major Optimality Tolerance $r$ Default $\text{}=2\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({10}^{-6},\sqrt{\epsilon }\right)$
This tolerance, $r$, specifies the final accuracy of the dual variables. On successful termination, nag_opt_sparse_nlp_solve (e04vhc) will have computed a solution $\left(x,s,\pi \right)$ such that
 $cmax=maxj cj ​ ​/​ ​ π ≤ r ,$ (14)
where ${c}_{\mathit{j}}$ is an estimate of the complementarity slackness for variable $\mathit{j}$, for $\mathit{j}=1,2,\dots ,n+\mathit{nf}$. The values ${c}_{i}$ are computed from the final QP solution using the reduced gradients ${d}_{j}={g}_{j}-{\pi }^{\mathrm{T}}{a}_{j}$ (where ${g}_{j}$ is the $j$th component of the objective gradient, ${a}_{j}$ is the associated column of the constraint matrix $\left(\begin{array}{cc}A& -I\end{array}\right)$, and $\pi$ is the set of QP dual variables):
 $cj = - dj min xj - lj ,1 if ​ dj≥0 ; -dj min uj - xj ,1 if ​ dj<0 .$ (15)
In the ${\mathbf{Print File}}$, ${c}_{\mathrm{max}}$ appears as the quantity labelled ‘Optimal’.
 Major Iterations Limit $i$ Default $\text{}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1000,3\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(n,\mathit{nf}\right)\right)$
This is the maximum number of major iterations allowed. It is intended to guard against an excessive number of linearizations of the constraints. If $i=0$, optimality and feasibility are checked.
 Major Print Level $i$ Default $\text{}=000001$
This controls the amount of output to the optional arguments ${\mathbf{Print File}}$ and ${\mathbf{Summary File}}$ at each major iteration. ${\mathbf{Major Print Level}}=0$ suppresses most output, except for error messages. ${\mathbf{Major Print Level}}=1$ gives normal output for linear and nonlinear problems, and ${\mathbf{Major Print Level}}=11$ gives additional details of the Jacobian factorization that commences each major iteration.
In general, the value being specified may be thought of as a binary number of the form
where each letter stands for a digit that is either $0$ or $1$ as follows:
 $s$ a single line that gives a summary of each major iteration. (This entry in $JFDXbs$ is not strictly binary since the summary line is printed whenever $JFDXbs\ge 1$); $b$ basis statistics, i.e., information relating to the basis matrix whenever it is refactorized. (This output is always provided if $JFDXbs\ge 10$); $X$ ${x}_{k}$, the nonlinear variables involved in the objective function or the constraints. These appear under the heading ‘Jacobian variables’; $D$ ${\pi }_{k}$, the dual variables for the nonlinear constraints. These appear under the heading ‘Multiplier estimates’; $F$ $f\left({x}_{k}\right)$, the values of the nonlinear constraint functions; $J$ $J\left({x}_{k}\right)$, the Jacobian matrix. This appears under the heading ‘$x$ and Jacobian’.
To obtain output of any items $JFDXbs$, set the corresponding digit to $1$, otherwise to $0$.
If $J=1$, the Jacobian matrix will be output column-wise at the start of each major iteration. Column $j$ will be preceded by the value of the corresponding variable ${x}_{j}$ and a key to indicate whether the variable is basic, superbasic or nonbasic. (Hence if $J=1$, there is no reason to specify $X=1$ unless the objective contains more nonlinear variables than the Jacobian.) A typical line of output is
` 3 1.250000e+01 BS 1 1.00000e+00 4 2.00000e+00 `
which would mean that ${x}_{3}$ is basic at value $12.5$, and the third column of the Jacobian has elements of $1.0$ and $2.0$ in rows $1$ and $4$.
 Major Step Limit $r$ Default $\text{}=2.0$
This argument limits the change in $x$ during a linesearch. It applies to all nonlinear problems, once a ‘feasible solution’ or ‘feasible subproblem’ has been found.
1. A linesearch determines a step $\alpha$ over the range $0<\alpha \le \beta$, where $\beta$ is $1$ if there are nonlinear constraints or is the step to the nearest upper or lower bound on $x$ if all the constraints are linear. Normally, the first step length tried is ${\alpha }_{1}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(1,\beta \right)$.
2. In some cases, such as $f\left(x\right)=a{e}^{bx}$ or $f\left(x\right)=a{x}^{b}$, even a moderate change in the components of $x$ can lead to floating point overflow. The argument $r$ is therefore used to define a limit $\stackrel{-}{\beta }=r\left(1+‖x‖\right)/‖p‖$ (where $p$ is the search direction), and the first evaluation of $f\left(x\right)$ is at the potentially smaller step length ${\alpha }_{1}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(1,\stackrel{-}{\beta },\beta \right)$.
3. Wherever possible, upper and lower bounds on $x$ should be used to prevent evaluation of nonlinear functions at meaningless points. The optional argument ${\mathbf{Major Step Limit}}$ provides an additional safeguard. The default value $r=2.0$ should not affect progress on well behaved problems, but setting $r=0.1\text{​ or ​}0.01$ may be helpful when rapidly varying functions are present. A ‘good’ starting point may be required. An important application is to the class of nonlinear least squares problems.
4. In cases where several local optima exist, specifying a small value for $r$ may help locate an optimum near the starting point.
 Minimize Default
 Maximize
 Feasible Point
The keywords ${\mathbf{Minimize}}$ and ${\mathbf{Maximize}}$ specify the required direction of optimization. It applies to both linear and nonlinear terms in the objective.
The keyword ${\mathbf{Feasible Point}}$ means ‘Ignore the objective function, while finding a feasible point for the linear and nonlinear constraints’. It can be used to check that the nonlinear constraints are feasible without altering the call to nag_opt_sparse_nlp_solve (e04vhc).
 Minor Feasibility Tolerance $r$ Default $\text{}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({10}^{-6},\sqrt{\epsilon }\right)$
 Feasibility Tolerance $r$ Default $\text{}=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left\{{10}^{-6},\sqrt{\epsilon }\right\}$
nag_opt_sparse_nlp_solve (e04vhc) tries to ensure that all variables eventually satisfy their upper and lower bounds to within this tolerance, $r$. This includes slack variables. Hence, general linear constraints should also be satisfied to within $r$.
Feasibility with respect to nonlinear constraints is judged by the optional argument ${\mathbf{Major Feasibility Tolerance}}$ (not by $r$).
If the bounds and linear constraints cannot be satisfied to within $r$, the problem is declared infeasible. If sinf is quite small, it may be appropriate to raise $r$ by a factor of $10$ or $100$. Otherwise, some error in the data should be suspected.
Nonlinear functions will be evaluated only at points that satisfy the bounds and linear constraints. If there are regions where a function is undefined, every attempt should be made to eliminate these regions from the problem.
For example, if $f\left(x\right)=\sqrt{{x}_{1}}+\mathrm{log}\left({x}_{2}\right)$, it is essential to place lower bounds on both variables. If $r=\text{1.0e−6}$, the bounds ${x}_{1}\ge {10}^{-5}$ and ${x}_{2}\ge {10}^{-4}$ might be appropriate. (The log singularity is more serious. In general, keep $x$ as far away from singularities as possible.)
If ${\mathbf{Scale Option}}\ge 1$, feasibility is defined in terms of the scaled problem (since it is then more likely to be meaningful).
In reality, nag_opt_sparse_nlp_solve (e04vhc) uses $r$ as a feasibility tolerance for satisfying the bounds on $x$ and $s$ in each QP subproblem. If the sum of infeasibilities cannot be reduced to zero, the QP subproblem is declared infeasible. nag_opt_sparse_nlp_solve (e04vhc) is then in elastic mode thereafter (with only the linearized nonlinear constraints defined to be elastic). See the description of the optional argument ${\mathbf{Elastic Weight}}$.
 Minor Iterations Limit $i$ Default $\text{}=500$
If the number of minor iterations for the optimality phase of the QP subproblem exceeds $i$, then all nonbasic QP variables that have not yet moved are frozen at their current values and the reduced QP is solved to optimality.
Note that more than $i$ minor iterations may be necessary to solve the reduced QP to optimality. These extra iterations are necessary to ensure that the terminated point gives a suitable direction for the linesearch.
In the major iteration log (see Section 12.2) a t at the end of a line indicates that the corresponding QP was artificially terminated using the limit $i$.
Compare with the optional argument ${\mathbf{Iterations Limit}}$, which defines an independent absolute limit on the total number of minor iterations (summed over all QP subproblems).
 Minor Print Level $i$ Default $\text{}=1$
This controls the amount of output to the ${\mathbf{Print File}}$ and ${\mathbf{Summary File}}$ during solution of the QP subproblems. The value of $i$ has the following effect:
 $i$ Meaning $0$ No minor iteration output except error messages. $\ge 1$ A single line of output at each minor iteration (controlled by optional arguments ${\mathbf{Print Frequency}}$ and ${\mathbf{Summary Frequency}}$. $\ge 10$ Basis factorization statistics generated during the periodic refactorization of the basis (see the optional argument ${\mathbf{Factorization Frequency}}$). Statistics for the first factorization each major iteration are controlled by the optional argument ${\mathbf{Major Print Level}}$.
 New Basis File ${i}_{1}$ Default $\text{}=0$
 Backup Basis File ${i}_{2}$ Default $\text{}=0$
 Save Frequency ${i}_{3}$ Default $\text{}=100$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
${\mathbf{New Basis File}}$ and ${\mathbf{Backup Basis File}}$ are sometimes referred to as basis maps. They contain the most compact representation of the state of each variable. They are intended for restarting the solution of a problem at a point that was reached by an earlier run. For nontrivial problems, it is advisable to save basis maps at the end of a run, in order to restart the run if necessary.
If ${\mathbf{New Basis File}}>0$, a basis map will be saved in the file associated with ID ${i}_{1}$ every ${i}_{3}$th iteration. The first record of the file will contain the word PROCEEDING if the run is still in progress. A basis map will also be saved at the end of a run, with some other word indicating the final solution status.
If ${\mathbf{Backup Basis File}}>0$, it is intended as a safeguard against losing the results of a long run. Suppose that a ${\mathbf{New Basis File}}$ is being saved every $100$ (${\mathbf{Save Frequency}}$) iterations, and that nag_opt_sparse_nlp_solve (e04vhc) is about to save such a basis at iteration $2000$. It is conceivable that the run may be interrupted during the next few milliseconds (in the middle of the save). In this case the Basis file will be corrupted and the run will have been essentially wasted.
To eliminate this risk, both a ${\mathbf{New Basis File}}$ and a ${\mathbf{Backup Basis File}}$ may be specified using calls of nag_open_file (x04acc).
The current basis will then be saved every $100$ iterations, first in the ${\mathbf{New Basis File}}$ and then immediately in the ${\mathbf{Backup Basis File}}$. If the run is interrupted at iteration $2000$ during the save in the ${\mathbf{New Basis File}}$ there will still be a usable basis in the ${\mathbf{Backup Basis File}}$.
Note that a new basis will be saved in ${\mathbf{New Basis File}}$ at the end of a run if it terminates normally, but it will not be saved in ${\mathbf{Backup Basis File}}$. In the above example, if an optimum solution is found at iteration $2050$ (or if the iteration limit is $2050$), the final basis in the ${\mathbf{Backup Basis File}}$ will correspond to iteration $2050$, but the last basis saved in the ${\mathbf{New Basis File}}$ will be the one for iteration $2000$.
A full description of information recorded in ${\mathbf{New Basis File}}$ and ${\mathbf{Backup Basis File}}$ is given in Gill et al. (2005a).
 New Superbasics Limit $i$ Default $\text{}=99$
This option causes early termination of the QP subproblems if the number of free variables has increased significantly since the first feasible point. If the number of new superbasics is greater than $i$, the nonbasic variables that have not yet moved are frozen and the resulting smaller QP is solved to optimality.
In the major iteration log (see Section 12.1), a t at the end of a line indicates that the QP was terminated early in this way.
 Nolist Default
 List
For nag_opt_sparse_nlp_solve (e04vhc), normally each optional argument specification is printed as it is supplied. Optional argument ${\mathbf{Nolist}}$ may be used to suppress the printing and optional argument ${\mathbf{List}}$ may be used to turn on printing.
 Old Basis File $i$ Default $\text{}=0$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
If ${\mathbf{Old Basis File}}>0$, the basis maps information will be obtained from the file associated with ID $i$. The file will usually have been output previously as a ${\mathbf{New Basis File}}$ or ${\mathbf{Backup Basis File}}$. A full description of information recorded in ${\mathbf{New Basis File}}$ and ${\mathbf{Backup Basis File}}$ is given in Gill et al. (2005a).
The file will not be acceptable if the number of rows or columns in the problem has been altered.
 Partial Price $i$ Default $\text{}=1$
This argument is recommended for large problems that have significantly more variables than constraints. It reduces the work required for each ‘pricing’ operation (where a nonbasic variable is selected to become superbasic). When $i=1$, all columns of the constraint matrix $\left(\begin{array}{cc}A& -I\end{array}\right)$ are searched. Otherwise, $A$ and $I$ are partitioned to give $i$ roughly equal segments ${A}_{\mathit{j}}$ and ${I}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,i$. If the previous pricing search was successful on ${A}_{j-1}$ and ${I}_{j-1}$, the next search begins on the segments ${A}_{j}$ and ${I}_{j}$. (All subscripts here are modulo $i$.) If a reduced gradient is found that is larger than some dynamic tolerance, the variable with the largest such reduced gradient (of appropriate sign) is selected to become superbasic. If nothing is found, the search continues on the next segments ${A}_{j+1}$ and ${I}_{j+1}$, and so on.
For time-stage models having $t$ time periods, ${\mathbf{Partial Price}}$ $t$ (or $t/2$ or $t/3$) may be appropriate.
 Pivot Tolerance $r$ Default $\text{}={\epsilon }^{\frac{2}{3}}$
During the solution of QP subproblems, the pivot tolerance is used to prevent columns entering the basis if they would cause the basis to become almost singular.
When $x$ changes to $x+\alpha p$ for some search direction $p$, a ‘ratio test’ determines which component of $x$ reaches an upper or lower bound first. The corresponding element of $p$ is called the pivot element. Elements of $p$ are ignored (and therefore cannot be pivot elements) if they are smaller than the pivot tolerance $r$.
It is common for two or more variables to reach a bound at essentially the same time. In such cases, the ${\mathbf{Minor Feasibility Tolerance}}$ (say, $t$) provides some freedom to maximize the pivot element and thereby improve numerical stability. Excessively small values of $t$ should therefore not be specified. To a lesser extent, the ${\mathbf{Expand Frequency}}$ (say, $f$) also provides some freedom to maximize the pivot element. Excessively large values of $f$ should therefore not be specified.
 Print File $i$ Default $\text{}=0$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
If ${\mathbf{Print File}}>0$, the following information is output to a file associated with ID $i$ during the solution of each problem:
 – a listing of the optional arguments; – some statistics about the problem; – the amount of storage available for the $LU$ factorization of the basis matrix; – notes about the initial basis resulting from a Crash procedure or a Basis file; – the iteration log; – basis factorization statistics; – the exit fail condition and some statistics about the solution obtained; – the printed solution, if requested.
These items are described in Sections 8 and 12. Further brief output may be directed to the ${\mathbf{Summary File}}$.
 Print Frequency $i$ Default $\text{}=100$
If $i>0$, one line of the iteration log will be printed every $i$th iteration. A value such as $i=10$ is suggested for those interested only in the final solution. If $i\le 0$, the value of $i=99999999$ is used and effectively no checks are made.
 Proximal Point Method $i$ Default $\text{}=1$
$i=1\text{​ or ​}2$ specifies minimization of ${‖x-{x}_{0}‖}_{1}$ or $\frac{1}{2}{‖x-{x}_{0}‖}_{2}^{2}$ when the starting point ${x}_{0}$ is changed to satisfy the linear constraints (where ${x}_{0}$ refers to nonlinear variables).
 Punch File ${i}_{1}$ Default $=0$
 Insert File ${i}_{2}$ Default $=0$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
The ${\mathbf{Punch File}}$ from a previous run may be used as an ${\mathbf{Insert File}}$ for a later run on the same problem. A full description of information recorded in ${\mathbf{Insert File}}$ and ${\mathbf{Punch File}}$ is given in Gill et al. (2005a).
If ${\mathbf{Punch File}}>0$, the final solution obtained will be output to the file associated with ID ${i}_{1}$. For linear programs, this format is compatible with various commercial systems.
If ${\mathbf{Insert File}}>0$, the file associated with ID ${i}_{2}$, containing basis information, will be read. The file will usually have been output previously as a ${\mathbf{Punch File}}$. The file will not be accessed if ${\mathbf{Old Basis File}}$ is specified.
 Scale Option $i$ Default $\text{}=0$
 Scale Tolerance $r$ Default $\text{}=0.9$
 Scale Print
Three scale options are available as follows:
 $i$ Meaning 0 No scaling. This is recommended if it is known that $x$ and the constraint matrix never have very large elements (say, larger than $100$). 1 The constraints and variables are scaled by an iterative procedure that attempts to make the matrix coefficients as close as possible to $1.0$ (see Fourer (1982)). This will sometimes improve the performance of the solution procedures. 2 The constraints and variables are scaled by the iterative procedure. Also, a certain additional scaling is performed that may be helpful if the right-hand side $b$ or the solution $x$ is large. This takes into account columns of $\left(\begin{array}{cc}A& -I\end{array}\right)$ that are fixed or have positive lower bounds or negative upper bounds.
Optional argument ${\mathbf{Scale Tolerance}}$ affects how many passes might be needed through the constraint matrix. On each pass, the scaling procedure computes the ratio of the largest and smallest nonzero coefficients in each column:
 $ρj=maxj aij / mini aij aij ≠ 0 .$
If $\underset{j}{\mathrm{max}}\phantom{\rule{0.25em}{0ex}}{\rho }_{j}$ is less than $r$ times its previous value, another scaling pass is performed to adjust the row and column scales. Raising $r$ from $0.9$ to $0.99$ (say) usually increases the number of scaling passes through $A$. At most $10$ passes are made. The value of $r$ should lie in the range $0.
${\mathbf{Scale Print}}$ causes the row scales $r\left(i\right)$ and column scales $c\left(j\right)$ to be printed to ${\mathbf{Print File}}$, if ${\mathbf{System Information Yes}}$ has been specified. The scaled matrix coefficients are ${\stackrel{-}{a}}_{ij}={a}_{ij}c\left(j\right)/r\left(i\right)$, and the scaled bounds on the variables and slacks are ${\stackrel{-}{l}}_{j}={l}_{j}/c\left(j\right)$, ${\stackrel{-}{u}}_{j}={u}_{j}/c\left(j\right)$, where $c\left(j\right)=r\left(j-n\right)$ if $j>n$.
 Solution File $i$ Default $\text{}=0$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
If ${\mathbf{Solution File}}>0$, the final solution will be output to the file associated with ID $i$.
To see more significant digits in the printed solution, it will sometimes be useful to specify that the ${\mathbf{Solution File}}$ refers to the ${\mathbf{Print File}}$.
 Summary File ${i}_{1}$ Default $\text{}=0$
 Summary Frequency ${i}_{2}$ Default $\text{}=100$
(See Section 3.2.1.1 in the Essential Introduction for further information on NAG data types.)
If ${\mathbf{Summary File}}>0$, a brief log will be output to the file associated with ${i}_{1}$, including one line of information every ${i}_{2}$th iteration. In an interactive environment, it is useful to direct this output to the terminal, to allow a run to be monitored online. (If something looks wrong, the run can be manually terminated.) Further details are given in Section 12.6.
 Superbasics Limit $i$ Default $\text{}={n}_{1}$
This option places a limit on the storage allocated for superbasic variables. Ideally, $i$ should be set slightly larger than the ‘number of degrees of freedom’ expected at an optimal solution.
For nonlinear problems, the number of degrees of freedom is often called the ‘number of independent variables’. Normally, $i$ need not be greater than $n+1$, where ${n}_{1}$ is the number of nonlinear variables. For many problems, $i$ may be considerably smaller than $n$. This will save storage if $n$ is very large.
 Suppress Parameters
Normally nag_opt_sparse_nlp_solve (e04vhc) prints the options file as it is being read, and then prints a complete list of the available keywords and their final values. The optional argument ${\mathbf{Suppress Parameters}}$ tells nag_opt_sparse_nlp_solve (e04vhc) not to print the full list.
 System Information No Default
 System Information Yes
This option prints additional information on the progress of major and minor iterations, and Crash statistics. See Section 12.
 Timing Level $i$ Default $\text{}=0$
If $i>0$, some timing information will be output to the Print file, if ${\mathbf{Print File}}>0$.
 Unbounded Objective ${r}_{1}$ Default $\text{}=\text{1.0e+15}$
 Unbounded Step Size ${r}_{2}$ Default $\text{}=\mathit{infbnd}$
These arguments are intended to detect unboundedness in nonlinear problems. During a linesearch, ${F}_{\mathrm{obj}}$ is evaluated at points of the form $x+\alpha p$, where $x$ and $p$ are fixed and $\alpha$ varies. If $\left|{F}_{\mathrm{obj}}\right|$ exceeds ${r}_{1}$ or $\alpha$ exceeds ${r}_{2}$, iterations are terminated with the exit message NE_UNBOUNDED.
If singularities are present, unboundedness in ${F}_{\mathrm{obj}}\left(x\right)$ may be manifested by a floating point overflow (during the evaluation of ${F}_{\mathrm{obj}}\left(x+\alpha p\right)$), before the test against ${r}_{1}$ can be made.
Unboundedness in $x$ is best avoided by placing finite upper and lower bounds on the variables.
 Verify Level $i$ Default $\text{}=0$
This option refers to finite difference checks on the derivatives computed by the user-supplied functions. Derivatives are checked at the first point that satisfies all bounds and linear constraints.
 $i$ Meaning $0$ Only a ‘cheap’ test will be performed, requiring two calls to usrfun. $1$ Individual gradients will be checked (with a more reliable test). A key of the form OK or Bad? indicates whether or not each component appears to be correct. $2$ Individual columns of the problem Jacobian will be checked. $3$ Options 2 and 1 will both occur (in that order). $-1$ Derivative checking is disabled.
${\mathbf{Verify Level}}=3$ should be specified whenever a new usrfun is being developed.
 Violation Limit $r$ Default $\text{}=\text{1.0e+6}$
This keyword defines an absolute limit on the magnitude of the maximum constraint violation, $r$, after the linesearch. On completion of the linesearch, the new iterate ${x}_{k+1}$ satisfies the condition
 $vi xk+1 ≤ r ​ ​ max1, vi x0 ,$
where ${x}_{0}$ is the point at which the nonlinear constraints are first evaluated and ${v}_{i}\left(x\right)$ is the $i$th nonlinear constraint violation ${v}_{i}\left(x\right)=\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(0,{l}_{i}-{f}_{i}\left(x\right),{f}_{i}\left(x\right)-{u}_{i}\right)$.
The effect of this violation limit is to restrict the iterates to lie in an expanded feasible region whose size depends on the magnitude of $r$. This makes it possible to keep the iterates within a region where the objective is expected to be well-defined and bounded below. If the objective is bounded below for all values of the variables, then $r$ may be any large positive value.

## 12  Description of Monitoring Information

nag_opt_sparse_nlp_solve (e04vhc) produces monitoring information, statistical information and information about the solution. Section 8.1 contains details of the final output information sent to the unit specified by the optional argument ${\mathbf{Print File}}$. This section contains other details of output information.

### 12.1  Major Iteration Log

This section describes the output to unit ${\mathbf{Print File}}$ if ${\mathbf{Major Print Level}}>0$. One line of information is output every $k$th major iteration, where $k$ is ${\mathbf{Print Frequency}}$.
 Label Description Itns is the cumulative number of minor iterations. Major is the current major iteration number. Minors is the number of iterations required by both the feasibility and optimality phases of the QP subproblem. Generally, Minors will be $1$ in the later iterations, since theoretical analysis predicts that the correct active set will be identified near the solution (see Section 10). Step is the step length $\alpha$ taken along the current search direction $p$. The variables $x$ have just been changed to $x+\alpha p$. On reasonably well-behaved problems, the unit step will be taken as the solution is approached. nCon the number of times usrfun has been called to evaluate the nonlinear problem functions. Evaluations needed for the estimation of the derivatives by finite differences are not included. nCon is printed as a guide to the amount of work required for the linesearch. Feasible is the value of ${v}_{\mathrm{max}}$ (see (13)), the maximum component of the scaled nonlinear constraint residual (see optional argument ${\mathbf{Major Feasibility Tolerance}}$). The solution is regarded as acceptably feasible if Feasible is less than the ${\mathbf{Major Feasibility Tolerance}}$. In this case, the entry is contained in parentheses. If the constraints are linear, all iterates are feasible and this entry is not printed. Optimal is the value of ${c}_{\mathrm{max}}$ (see (14)), the maximum complementary gap (see optional argument ${\mathbf{Major Optimality Tolerance}}$). It is an estimate of the degree of nonoptimality of the reduced costs. Both Feasible and Optimal are small in the neighbourhood of a solution. MeritFunction is the value of the augmented Lagrangian merit function (see (8)). This function will decrease at each iteration unless it was necessary to increase the penalty arguments (see Section 10.4). As the solution is approached, MeritFunction will converge to the value of the objective at the solution. In elastic mode, the merit function is a composite function involving the constraint violations weighted by the elastic weight. If the constraints are linear, this item is labelled Objective, the value of the objective function. It will decrease monotonically to its optimal value. L+U is the number of nonzeros representing the basis factors $L$ and $U$ on completion of the QP subproblem. If nonlinear constraints are present, the basis factorization $B=LU$ is computed at the start of the first minor iteration. At this stage, $\mathtt{L+U}=\mathtt{lenL+lenU}$, where lenL (see Section 12.4) is the number of subdiagonal elements in the columns of a lower triangular matrix and lenU (see Section 12.4) is the number of diagonal and superdiagonal elements in the rows of an upper-triangular matrix. As columns of $B$ are replaced during the minor iterations, L+U may fluctuate up or down but, in general, will tend to increase. As the solution is approached and the minor iterations decrease towards zero, L+U will reflect the number of nonzeros in the $LU$ factors at the start of the QP subproblem. If the constraints are linear, refactorization is subject only to the ${\mathbf{Factorization Frequency}}$, and L+U will tend to increase between factorizations. BSwap is the number of columns of the basis matrix $B$ that were swapped with columns of $S$ to improve the condition of $B$. The swaps are determined by an $LU$ factorization of the rectangular matrix  with stability being favoured more than sparsity. nS is the current number of superbasic variables. condHz is an estimate of the condition number of ${R}^{\mathrm{T}}R$, itself an estimate of ${Z}^{\mathrm{T}}HZ$, the reduced Hessian of the Lagrangian. The condition number is the square of the ratio of the largest and smallest diagonals of the upper triangular matrix $R$, this being a lower bound on the condition number of ${R}^{\mathrm{T}}R$. condHz gives a rough indication of whether or not the optimization procedure is having difficulty. If $\epsilon$ is the relative machine precision being used, the SQP algorithm will make slow progress if condHz becomes as large as ${\epsilon }^{-1/2}\approx {10}^{8}$, and will probably fail to find a better solution if condHz reaches ${\epsilon }^{-3/4}\approx {10}^{12}$. To guard against high values of condHz, attention should be given to the scaling of the variables and the constraints. In some cases it may be necessary to add upper or lower bounds to certain variables to keep them a reasonable distance from singularities in the nonlinear functions or their derivatives. Penalty is the Euclidean norm of the vector of penalty arguments used in the augmented Lagrangian merit function (not printed if there are no nonlinear constraints).
The summary line may include additional code characters that indicate what happened during the course of the major iteration. These will follow the separator ‘_’ in the output
 Label Description c central differences have been used to compute the unknown components of the objective and constraint gradients. A switch to central differences is made if either the linesearch gives a small step, or $x$ is close to being optimal. In some cases, it may be necessary to re-solve the QP subproblem with the central difference gradient and Jacobian. d during the linesearch it was necessary to decrease the step in order to obtain a maximum constraint violation conforming to the value of the optional argument ${\mathbf{Violation Limit}}$. D you set ${\mathbf{status}}=-1$ on exit from usrfun, indicating that the linesearch needed to be done with a smaller value of the step length $\alpha$. l the norm wise change in the variables was limited by the value of the optional argument ${\mathbf{Major Step Limit}}$. If this output occurs repeatedly during later iterations, it may be worthwhile increasing the value of the optional argument ${\mathbf{Major Step Limit}}$. i if nag_opt_sparse_nlp_solve (e04vhc) is not in elastic mode, an i signifies that the QP subproblem is infeasible. This event triggers the start of nonlinear elastic mode, which remains in effect for all subsequent iterations. Once in elastic mode, the QP subproblems are associated with the elastic problem (12) (see Section 10.5). If nag_opt_sparse_nlp_solve (e04vhc) is already in elastic mode, an i indicates that the minimizer of the elastic subproblem does not satisfy the linearized constraints. (In this case, a feasible point for the usual QP subproblem may or may not exist.) M an extra evaluation of the problem functions was needed to define an acceptable positive definite quasi-Newton update to the Lagrangian Hessian. This modification is only done when there are nonlinear constraints. m this is the same as M except that it was also necessary to modify the update to include an augmented Lagrangian term. n no positive definite BFGS update could be found. The approximate Hessian is unchanged from the previous iteration. R the approximate Hessian has been reset by discarding all but the diagonal elements. This reset will be forced periodically by the ${\mathbf{Hessian Frequency}}$ and ${\mathbf{Hessian Updates}}$ keywords. However, it may also be necessary to reset an ill-conditioned Hessian from time to time. r the approximate Hessian was reset after ten consecutive major iterations in which no BFGS update could be made. The diagonals of the approximate Hessian are retained if at least one update has been done since the last reset. Otherwise, the approximate Hessian is reset to the identity matrix. s a self-scaled BFGS update was performed. This update is used when the Hessian approximation is diagonal, and hence always follows a Hessian reset. t the minor iterations were terminated because of the ${\mathbf{Minor Iterations Limit}}$. T the minor iterations were terminated because of the ${\mathbf{New Superbasics Limit}}$. u the QP subproblem was unbounded. w a weak solution of the QP subproblem was found. z the ${\mathbf{Superbasics Limit}}$ was reached.

### 12.2  Minor Iteration Log

If ${\mathbf{Minor Print Level}}>0$, one line of information is output to the Print file every $k$th minor iteration, where $k$ is the specified ${\mathbf{Print Frequency}}$. A heading is printed before the first such line following a basis factorization. The heading contains the items described below. In this description, a pricing operation is the process by which a nonbasic variable is selected to become superbasic (in addition to those already in the superbasic set). The selected variable is denoted by jq. Variable jq often becomes basic immediately. Otherwise it remains superbasic, unless it reaches its opposite bound and returns to the nonbasic set.
If ${\mathbf{Partial Price}}$ is in effect, variable jq is selected from ${A}_{\mathtt{pp}}$ or ${I}_{\mathtt{pp}}$, the $\mathtt{pp}$th segments of the constraint matrix $\left(\begin{array}{cc}A& -I\end{array}\right)$.
 Label Description Itn the current iteration number. LPmult or QPmult is the reduced cost (or reduced gradient) of the variable jq selected by the pricing procedure at the start of the present iteration. Algebraically, the reduced gradient is ${d}_{j}={g}_{j}-{\pi }^{\mathrm{T}}{a}_{j}$ for $j=\mathtt{jq}$, where ${g}_{j}$ is the gradient of the current objective function, $\pi$ is the vector of dual variables for the QP subproblem, and ${a}_{j}$ is the $j$th column of $\left(\begin{array}{cc}A& -I\end{array}\right)$. Note that the reduced cost is the $1$-norm of the reduced-gradient vector at the start of the iteration, just after the pricing procedure. LPstep or QPstep is the step length $\alpha$ taken along the current search direction $p$. The variables $x$ have just been changed to $x+\alpha p$. Write Step to stand for LPStep or QPStep, depending on the problem. If a variable is made superbasic during the current iteration ($\mathtt{+SBS}>0$), Step will be the step to the nearest bound. During Phase 2, the step can be greater than one only if the reduced Hessian is not positive definite. nInf is the number of infeasibilities after the present iteration. This number will not increase unless the iterations are in elastic mode. SumInf is the sum of infeasibilities after the present iteration, if $\mathtt{nInf}>0$. The value usually decreases at each nonzero Step, but if it decreases by $2$ or more, SumInf may occasionally increase. rgNorm is the norm of the reduced-gradient vector at the start of the iteration. (It is the norm of the vector with elements ${d}_{j}$ for variables $j$ in the superbasic set.) During Phase 2 this norm will be approximately zero after a unit step. (The heading is not printed if the problem is linear.) LPobjective or QPobjective the QP objective function after the present iteration. In elastic mode, the heading is changed to Elastic QPobj. In either case, the value printed decreases monotonically. +SBS is the variable jq selected by the pricing operation to be added to the superbasic set. -SBS is the superbasic variable chosen to become nonbasic. -BS is the basis variable removed (if any) to become nonbasic. Pivot if column ${a}_{q}$ replaces the $r$th column of the basis $B$, Pivot is the $r$th element of a vector $y$ satisfying $By={a}_{q}$. Wherever possible, Step is chosen to avoid extremely small values of Pivot (since they cause the basis to be nearly singular). In rare cases, it may be necessary to increase the ${\mathbf{Pivot Tolerance}}$ to exclude very small elements of $y$ from consideration during the computation of Step. L+U is the number of nonzeros representing the basis factors $L$ and $U$. Immediately after a basis factorization $B=LU$, L+U is lenL+lenU, the number of subdiagonal elements in the columns of a lower triangular matrix and the number of diagonal and superdiagonal elements in the rows of an upper-triangular matrix. Further nonzeros are added to L when various columns of $B$ are later replaced. As columns of $B$ are replaced, the matrix $U$ is maintained explicitly (in sparse form). The value of L will steadily increase, whereas the value of U may fluctuate up or down. Thus the value of L+U may fluctuate up or down (in general, it will tend to increase). ncp is the number of compressions required to recover storage in the data structure for $U$. This includes the number of compressions needed during the previous basis factorization. nS is the current number of superbasic variables. (The heading is not printed if the problem is linear.) condHz see Section 12.1. (The heading is not printed if the problem is linear.)

### 12.3  Crash Statistics

If ${\mathbf{Major Print Level}}\ge 10$ and ${\mathbf{System Information Yes}}$ has been specified, the following items are output to the Print file when ${\mathbf{start}}=\mathrm{Nag_Cold}$ and no Basis file is loaded. They refer to the number of columns that the Crash procedure selects during selected passes through $A$ while searching for a triangular basis matrix.
 Label Description Slacks is the number of slacks selected initially. Free cols is the number of free columns in the basis. Preferred is the number of ‘preferred’ columns in the basis (i.e., ${\mathbf{xstate}}\left[j-1\right]=3$ for some $j\le n$). Unit is the number of unit columns in the basis. Double is the number of columns in the basis containing $2$ nonzeros. Triangle is the number of triangular columns in the basis. Pad is the number of slacks used to pad the basis (to make it a nonsingular triangle).

### 12.4  Basis Factorization Statistics

If ${\mathbf{Major Print Level}}\ge 10$, the first seven items listed below are output to the Print file whenever the basis $B$ or the rectangular matrix  is factorized before solution of the next QP subproblem (see Section 11.1).
Note that ${B}_{S}$ may be factorized at the start of just some of the major iterations. It is immediately followed by a factorization of $B$ itself.
Gaussian elimination is used to compute a sparse $LU$ factorization of $B$ or ${B}_{S}$, where $PL{P}^{\mathrm{T}}$ and $PUQ$ are lower and upper triangular matrices, for some permutation matrices $P$ and $Q$. Stability is ensured as described under optional argument ${\mathbf{LU Factor Tolerance}}$.
If ${\mathbf{Minor Print Level}}\ge 10$, the same items are printed during the QP solution whenever the current $B$ is factorized. In addition, if ${\mathbf{System Information Yes}}$ has been specified, the entries from Elems onwards are also printed.
Label Description
Factor the number of factorizations since the start of the run.
Demand a code giving the reason for the present factorization, as follows:
 Code Meaning 0 First $LU$ factorization. 1 The number of updates reached the ${\mathbf{Factorization Frequency}}$. 2 The nonzeros in the updated factors have increased significantly. 7 Not enough storage to update factors. 10 Row residuals are too large (see the description of the optional argument ${\mathbf{Check Frequency}}$). 11 Ill-conditioning has caused inconsistent results.
Itn is the current minor iteration number.
Nonlin is the number of nonlinear variables in the current basis $B$.
Linear is the number of linear variables in $B$.
Slacks is the number of slack variables in $B$.
B, BR, BS or BT factorize is the type of $LU$ factorization.
 B periodic factorization of the basis $B$. BR more careful rank-revealing factorization of $B$ using threshold rook pivoting. This occurs mainly at the start, if the first basis factors seem singular or ill-conditioned. Followed by a normal B factorize. BS ${B}_{S}$ is factorized to choose a well-conditioned $B$ from the current . Followed by a normal B factorize. BT same as BS except the current $B$ is tried first and accepted if it appears to be not much more ill-conditioned than after the previous BS factorize.
m is the number of rows in $B$ or ${B}_{S}$.
n is the number of columns in $B$ or ${B}_{S}$. Preceded by ‘=’ or ‘>’ respectively.
Elems is the number of nonzero elements in $B$ or ${B}_{S}$.
Amax is the largest nonzero in $B$ or ${B}_{S}$.
Density is the percentage nonzero density of $B$ or ${B}_{S}$.
Merit/MerRP/MerCP Merit is the average Markowitz merit count for the elements chosen to be the diagonals of $PUQ$. Each merit count is defined to be $\left(c-1\right)\left(r-1\right)$ where $c$ and $r$ are the number of nonzeros in the column and row containing the element at the time it is selected to be the next diagonal. Merit is the average of n such quantities. It gives an indication of how much work was required to preserve sparsity during the factorization. If ${\mathbf{LU Complete Pivoting}}$ or ${\mathbf{LU Rook Pivoting}}$ has been selected, this heading is changed to MerCP, respectively MerRP.
lenL is the number of nonzeros in $L$.
L+U is the number of nonzeros representing the basis factors $L$ and $U$. Immediately after a basis factorization $B=LU$, this is lenL+lenU, the number of subdiagonal elements in the columns of a lower triangular matrix and the number of diagonal and superdiagonal elements in the rows of an upper-triangular matrix. Further nonzeros are added to L when various columns of $B$ are later replaced. As columns of $B$ are replaced, the matrix $U$ is maintained explicitly (in sparse form). The value of L will steadily increase, whereas the value of U may fluctuate up or down. Thus the value of L+U may fluctuate up or down (in general, it will tend to increase).
Cmpressns is the number of times the data structure holding the partially factored matrix needed to be compressed to recover unused storage. Ideally this number should be zero. If it is more than $3$ or $4$, the amount of workspace available to nag_opt_sparse_nlp_solve (e04vhc) should be increased for efficiency.
Incres is the percentage increase in the number of nonzeros in $L$ and $U$ relative to the number of nonzeros in $B$ or ${B}_{S}$.
Utri is the number of triangular rows of $B$ or ${B}_{S}$ at the top of $U$.
lenU the number of nonzeros in $U$, including its diagonals.
Ltol is the largest subdiagonal element allowed in $L$. This is the specified ${\mathbf{LU Factor Tolerance}}$ or a smaller value that is currently being used for greater stability.
Umax the maximum nonzero element in $U$.
Ugrwth is the ratio $\mathtt{Umax}/\mathtt{Amax}$, which ideally should not be substantially larger than $10.0$ or $100.0$. If it is orders of magnitude larger, it may be advisable to reduce the ${\mathbf{LU Factor Tolerance}}$ to $5.0$, $4.0$, $3.0$ or $2.0$, say (but bigger than $1.0$).
As long as Lmax is not large (say $5.0$ or less), $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(\mathtt{Amax},\mathtt{Umax}\right)/\mathtt{DUmin}$ gives an estimate of the condition number $B$. If this is extremely large, the basis is nearly singular. Slacks are used to replace suspect columns of $B$ and the modified basis is refactored.
Ltri is the number of triangular columns of $B$ or ${B}_{S}$ at the left of $L$.
dense1 is the number of columns remaining when the density of the basis matrix being factorized reached $0.3$.
Lmax is the actual maximum subdiagonal element in $L$ (bounded by Ltol).
Akmax is the largest nonzero generated at any stage of the $LU$ factorization. (Values much larger than Amax indicate instability.) Akmax is not printed if ${\mathbf{LU Partial Pivoting}}$ is selected.
Agrwth is the ratio $\mathtt{Akmax}/\mathtt{Amax}$. Values much larger than $100$ (say) indicate instability. Agrwth is not printed if ${\mathbf{LU Partial Pivoting}}$ is selected.
bump is the size of the block to be factorized nontrivially after the triangular rows and columns of $B$ or ${B}_{S}$ have been removed.
dense2 is the number of columns remaining when the density of the basis matrix being factorized reached $0.6$. (The Markowitz pivot strategy searches fewer columns at that stage.)
DUmax is the largest diagonal of $PUQ$.
DUmin is the smallest diagonal of $PUQ$.
condU the ratio $\mathtt{DUmax}/\mathtt{DUmin}$, which estimates the condition number of $U$ (and of $B$ if Ltol is less than $5.0$, say).

### 12.5  The Solution File

At the end of a run, the final solution may be output as a Solution file, according to ${\mathbf{Solution File}}$. Some header information appears first to identify the problem and the final state of the optimization procedure. A ROWS section and a COLUMNS section then follow, giving one line of information for each row and column. The format used is similar to certain commercial systems, though there is no industry standard.
The maximum record length is $111$ characters.
To reduce clutter, a full stop (.) is printed for any numerical value that is exactly zero. The values $±1$ are also printed specially as $1.0$ and $-1.0$. Infinite bounds ($±{10}^{20}$ or larger) are printed as None.
A Solution file is intended to be read from disk by a self-contained program that extracts and saves certain values as required for possible further computation. Typically, the first $14$ records would be ignored. The end of the ROWS section is marked by a record that starts with a $1$ and is otherwise blank. If this and the next $4$ records are skipped, the COLUMNS section can then be read under the same format.
A full description of the ROWS section and the COLUMNS section is given in Sections 8.1.1 and 8.1.2.

### 12.6  The Summary File

If ${\mathbf{Summary File}}>0$, the following information is output to the ${\mathbf{Summary File}}$. (It is a brief summary of the output directed to unit ${\mathbf{Print File}}$):
 – the optional arguments supplied via the option setting functions, if any; – the Basis file loaded, if any; – a brief major iteration log (see Section 12.1); – a brief minor iteration log (see Section 12.2); – a summary of the final iterate.