naginterfaces.library.mip.iqp_​sparse

naginterfaces.library.mip.iqp_sparse(m, iobj, ncolh, a, ha, ka, bl, bu, start, names, crname, ns, xs, intvar, istate, strtgy, leniz, lenz, comm, qphx=None, mdepth=None, monit=None, data=None, io_manager=None)

iqp_sparse obtains integer solutions to sparse linear programming and quadratic programming problems.

Note: this function uses optional algorithmic parameters, see also: iqp_sparse_optfile(), iqp_sparse_optstr().

For full information please refer to the NAG Library document for h02ce

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/h/h02cef.html

Parameters

mint

$m$, the number of general linear constraints (or slacks). This is the number of rows in $A$, including the free row (if any; see $iobj$).

iobjint

If $iobj>0$, row $iobj$ of $A$ is a free row containing the nonzero elements of the vector $c$ appearing in the linear objective term $c^{T}x$.

If $iobj=0$, there is no free row, i.e., the problem is either an FP problem (in which case $iobj$ must be set to zero), or a QP problem with $c=0$.

ncolhint

$n_H$, the number of leading nonzero columns of the Hessian matrix $H$. For FP and LP problems, $ncolh$ must be set to zero.

afloat, array-like, shape $\left(\text{nnz}\right)$

On entry: the nonzero elements of $A$, ordered by increasing column index. Note that multiple elements with the same row and column indices are not allowed.

On exit: used as internal workspace prior to being restored and hence is unchanged.

haint, array-like, shape $\left(\text{nnz}\right)$

$ha\left[\text{i}\right]$ must contain the row index of the nonzero element stored in $a\left[\text{i}\right]$, for $\text{i}=1,2,\dots ,\text{nnz}$. Note that the row indices for a column may be supplied in any order.

kaint, array-like, shape $(n+1)$

$ka\left[\text{j}\right]$ must contain the index in $a$ of the start of the $\text{j}$th column, for $\text{j}=1,2,\dots ,n$. To specify the $j$th column as empty, set $ka\left[j\right]=ka[j+1]$. Note that the first and last elements of $ka$ must be such that $ka\left[0\right]=1$ and $ka\left[n\right]=\text{nnz}+1$.

blfloat, array-like, shape $(n+m)$

$l$, the lower bounds for all the variables and general constraints, in the following order. The first $\text{n}$ elements of $bl$ must contain the bounds on the variables $x$, and the next $m$ elements the bounds for the general linear constraints $Ax$ (or slacks $s$) and the free row (if any). To specify a nonexistent lower bound (i.e., $l_j=-\infty$), set $bl\left[j\right]\le -\text{bigbnd}$, where $\text{bigbnd}$ is the value of the option ‘Infinite Bound Size’ ($\text{default value}={10}^{20}$). To specify the $j$th constraint as an equality, set $bl\left[j\right]=bu\left[j\right]=\beta$, say, where $\left|\beta \right|<\text{bigbnd}$. Note that the lower bound corresponding to the free row must be set to $-\infty$ and stored in $bl[n+iobj-1]$.

bufloat, array-like, shape $(n+m)$

On entry: $u$, the upper bounds for all the variables and general constraints, in the following order. The first $\text{n}$ elements of $bl$ must contain the bounds on the variables $x$, and the next $m$ elements the bounds for the general linear constraints $Ax$ (or slacks $s$) and the free row (if any). To specify a nonexistent upper bound (i.e., $u_j=+\infty$), set $bu\left[j\right]\ge \text{bigbnd}$. Note that the upper bound corresponding to the free row must be set to $+\infty$ and stored in $bu[n+iobj-1]$.

On exit: used as internal workspace prior to being restored and hence is unchanged.

startstr, length 1

Indicates how a starting basis is to be obtained.

$start=\text{'C'}$

An internal crash procedure will be used to choose an initial basis matrix $B$.

$start=\text{'W'}$

A basis is already defined in $istate$ (probably from a previous call).

namesstr, length 8, array-like, shape $\left(5\right)$

A set of names associated with the so-called MPSX form of the problem.

$names\left[0\right]$

Must contain the name for the problem (or be blank).

$names\left[1\right]$

Must contain the name for the free row (or be blank).

$names\left[2\right]$

Must contain the name for the constraint right-hand side (or be blank).

$names\left[3\right]$

Must contain the name for the ranges (or be blank).

$names\left[4\right]$

Must contain the name for the bounds (or be blank).

(These names are used in the monitoring file output; see Monitoring Information.)

crnamestr, length 8, array-like, shape $\left(\text{nname}\right)$

The optional column and row names.

If $\text{nname}=1$, $crname$ is not referenced and the printed output will use default names for the columns and rows.

If $\text{nname}=n+m$, the first $\text{n}$ elements must contain the names for the columns and the next $m$ elements must contain the names for the rows.

Note that the name for the free row (if any) must be stored in $crname[n+iobj]$.

nsint

$n_S$, the number of superbasics. For QP problems, $ns$ need not be specified if $start=\text{'C'}$, but must retain its value from a previous call when $start=\text{'W'}$. For FP and LP problems, $ns$ need not be initialized.

xsfloat, array-like, shape $(n+m)$

The initial values of the variables and slacks $(x,s)$. (See the description for $istate$.)

intvarint, array-like, shape $\left(\text{lintvr}\right)$

Specifies which components of the solution vector $x$ are constrained to be integer. Specifically, if $k$ elements of $x$ are required to take integer values then $intvar\left[\text{i}\right]=l_{\text{i}}$, for $\text{i}=1,2,\dots ,k$, where $l_i$ is the integer index such that $x_{l_i}$ is integer. If $k<\text{lintvr}$ then $intvar[k+1]$ must be set to $-1$ to signal the end of the integer variable indices.

The order in which the indices of those components of $x$ required to be integer is presented determines the order in which the sub-problems are treated and solved.

As such it can be a powerful tool to assist the function in achieving a solution efficiently.

The general advice is to enter the important integer variables in the model early in $intvar$; secondary or less important variables should be entered near the end of the list.

However some experimentation might be required to find the optimal order.

istateint, array-like, shape $(n+m)$

If $start=\text{'C'}$, the first $\text{n}$ elements of $istate$ and $xs$ must specify the initial states and values, respectively, of the variables $x$. (The slacks $s$ need not be initialized.) An internal crash procedure is then used to select an initial basis matrix $B$. The initial basis matrix will be triangular (neglecting certain small elements in each column). It is chosen from various rows and columns of columns of $(A-I)$. Possible values for $istate\left[j\right]$ are as follows:

$istate\left[j\right]$	State of $xs\left[j\right]$ during crash procedure
0 or $1$	Eligible for the basis
2	Ignored
3	Eligible for the basis (given preference over $0$ or $1$)
4 or $5$	Ignored

If nothing special is known about the problem, or there is no wish to provide special information, you may set $istate\left[\text{j}\right]=0$ and $xs\left[\text{j}\right]=0.0$, for $\text{j}=1,2,\dots ,n$. All variables will then be eligible for the initial basis. Less trivially, to say that the $j$th variable will probably be equal to one of its bounds, set $istate\left[j\right]=4$ and $xs\left[j\right]=bl\left[j\right]$ or $istate\left[j\right]=5$ and $xs\left[j\right]=bu\left[j\right]$ as appropriate.

Following the crash procedure, variables for which $istate\left[j\right]=2$ are made superbasic.

Other variables not selected for the basis are then made nonbasic at the value $xs\left[j\right]$ if $bl\left[j\right]\le xs\left[j\right]\le bu\left[j\right]$, or at the value $bl\left[j\right]$ or $bu\left[j\right]$ closest to $xs\left[j\right]$.

If $start=\text{'W'}$, $istate$ and $xs$ must specify the initial states and values, respectively, of the variables and slacks $(x,s)$.

If iqp_sparse has been called previously with the same values of $\text{n}$ and $m$, $istate$ already contains satisfactory information.

strtgyint

Defines the branching strategy adopted by the function.

$strtgy=0$

Each sub-problem first explored imposes a tighter upper bound on the component of $x$.

$strtgy=1$

Each sub-problem first explored imposes a tighter lower bound on the component of $x$.

$strtgy=2$

Each branch explored imposes a tighter upper bound on the component of $x$ if its fractional part is less than $0.5$, otherwise it imposes a tighter lower bound.

$strtgy=3$

Random choice is made between first exploring a tighter lower bound or a tighter upper bound sub-problem.

lenizint

The dimension of the internal workspace array $\text{iz}$.

lenzint

The dimension of the internal workspace array $\text{z}$.

commdict, communication object, modified in place

Communication structure.

This argument must have been initialized by a prior call to opt.nlp1_init with $\text{rname}=\text{'opt.qpconvex1\_sparse\_solve'}$.

qphxNone or callable hx = qphx(nstate, x, data=None), optional

Note: if this argument is None then a NAG-supplied facility will be used.

For QP problems, you must supply a version of $qphx$ to compute the matrix product $Hx$.

If $H$ has rows and columns consisting entirely of zeros, it is most efficient to order the variables $x={\left(yz\right)}^T$ so that

$$\begin{array}{c}Hx=\left(\begin{array}{cc}{H}_1& 0\\ 0& 0\end{array}\right)\left(\begin{array}{c}y\\ z\end{array}\right)=\left(\begin{array}{c}{H}_{1}y\\ 0\end{array}\right)\text{,}\end{array}$$

where the nonlinear variables $y$ appear first as shown.

For LP problems, $qphx$ will never be called by iqp_sparse.

Parameters

nstateint

If $nstate=1$, then iqp_sparse is calling $qphx$ for the first time on a sub-problem. This argument setting allows you to save computation time if certain data must be read or calculated only once.

If $nstate\ge 2$, then iqp_sparse is calling $qphx$ for the last time.

This argument setting allows you to perform some additional computation on the final sub-problem solution.

In general, the last call to $qphx$ is made with $nstate=2+\text{errno}$ (see Exceptions).

Otherwise, $nstate=0$.

xfloat, ndarray, shape $\left(\text{ncolh}\right)$

The first $ncolh$ elements of the vector $x$.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

hxfloat, array-like, shape $\left(\text{ncolh}\right)$

The product $Hx$.

mdepthNone or int, optional

Note: if this argument is None then a default value will be used, determined as follows: $2\times n+20$.

Specifies the maximum depth the tree of sub-problems may be developed.

monitNone or callable (bstval, halt) = monit(intfnd, nodes, depth, obj, x, bstval, bstsol, bl, bu, halt, data=None), optional

Note: if this argument is None then a NAG-supplied facility will be used.

To provide feed-back on the progress of the branch and bound process.

Additionally $monit$ provides, via its argument $halt$, the ability to terminate the process. (You might choose to do this when an integer solution is found, rather than search for a better solution.) If you do not require any intermediate output then $monit$ may be None.

Parameters

intfndint

Contains the number of integer solutions obtained so far.

nodesint

Contains the number of nodes (sub-problems) solved so far.

depthint

Contains the depth reached in the tree of problems.

objfloat

Contains the solution value to the sub-problem at this node.

xfloat, ndarray, shape $\left(n\right)$

Contains the solution vector to the sub-problem at this node.

bstvalfloat

Contains the value of the objective function corresponding to the best integer solution obtained so far. If no integer solution has been found $bstval$ contains the largest machine representable number (see machine.real_largest).

bstsolfloat, ndarray, shape $\left(n\right)$

Contains the value of the best integer solution obtained so far.

blfloat, ndarray, shape $\left(n\right)$

Contains the current lower bounds on the variables at this point.

bufloat, ndarray, shape $\left(n\right)$

Contains the current upper bounds on the variables at this point.

haltbool

Will have the value $False$.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

bstvalfloat

May be set to a cut-off value, if you are a sophisticated user, as follows. Before an integer solution has been found $bstval$ will be set by iqp_sparse to the largest machine representable number (see machine.real_largest). If you know that the solution being sought is a much smaller number, then $bstval$ may be set to this number as a cut-off value (see Notes). Beware of setting $bstval$ too small, since then no integer solutions will be discovered. Also, on entry to $monit$, $bstval$ should be set using a statement of the form

if intfnd == 0: bstval = cut_off_value

Setting $bstval$ in this way will not prevent the normal operation of the algorithm when subsequent integer solutions are found. It would be a grievous mistake to unconditionally set $bstval$ and if you have any doubts whatsoever about the correct use of this argument then you are strongly recommended to leave it unchanged.

haltbool

If $halt$ is set to $True$, opt.qpconvex1_sparse_solve will be brought to a halt with $\text{errno}$ exit $-1$. This facility may be useful if you are content with any integer solution, or with any integer solution that fits certain criteria. Under these circumstances setting $halt=True$ can save considerable unnecessary computation.

dataarbitrary, optional

User-communication data for callback functions.

io_managerFileObjManager, optional

Manager for I/O in this routine.

Returns

nsint

The final number of superbasics. This will be zero for FP and LP problems.

xsfloat, ndarray, shape $(n+m)$

$xs[\text{i}-1]$ contains the final value of $x_{\text{i}}$, for $\text{i}=1,2,\dots ,n$.

istateint, ndarray, shape $(n+m)$

The final states of the variables and slacks $(x,s)$ from the solution of the last sub-problem tackled. The significance of each possible value of $istate\left[j\right]$ is as follows:

$istate\left[j\right]$	State of variable $j$	Normal value of $xs\left[j\right]$
$0$	Nonbasic	$bl\left[j\right]$
$1$	Nonbasic	$bu\left[j\right]$
$2$	Superbasic	Between $bl\left[j\right]$ and $bu\left[j\right]$
$3$	Basic	Between $bl\left[j\right]$ and $bu\left[j\right]$

If $\text{Ninf}=0$ (see Further Comments), basic and superbasic variables may be outside their bounds by as much as the value of the option ‘Feasibility Tolerance’ ($\text{default value}=max({10}^{-6},\sqrt{ϵ})$, where $ϵ$ is the machine precision). Note that unless the option $\text{‘Scale Option'}=0$ ($\text{default value}=2$) 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.

Very occasionally some nonbasic variables may be outside their bounds by as much as the ‘Feasibility Tolerance’, and there may be some nonbasic variables for which $xs\left[j\right]$ lies strictly between its bounds.

If $\text{Ninf}>0$, some basic and superbasic variables may be outside their bounds by an arbitrary amount (bounded by Sinf (see Further Comments) if $\text{‘Scale Option'}=0$).

minizint

The minimum value of $leniz$ required to start solving the problem. If $errno$ = 14, iqp_sparse may be called again with $leniz$ suitably larger than $miniz$. (The bigger the better, since it is not certain how much workspace the basis factors need.)

minzint

The minimum value of $lenz$ required to start solving the problem. If $errno$ = 15, iqp_sparse may be called again with $lenz$ suitably larger than $minz$. (The bigger the better, since it is not certain how much workspace the basis factors need.)

objfloat

The value of the objective function.

If $\text{Ninf}=0$, $obj$ includes the quadratic objective term $\frac{1}{2}{x}^{T}Hx$ (if any).

If $\text{Ninf}>0$, $obj$ is just the linear objective term $c^{T}x$ (if any).

For FP problems, $obj$ is set to zero.

clamdafloat, ndarray, shape $(n+m)$

A set of Lagrange-multipliers for the bounds on the variables and the general constraints. More precisely, the first $\text{n}$ elements contain the multipliers (reduced costs) for the bounds on the variables, and the next $m$ elements contain the multipliers (shadow prices) for the general linear constraints.

Other Parameters

‘Check Frequency’int

Default $=60$

Every $i$th iteration after the most recent basis factorization, a numerical test is made to see if the current solution $(x,s)$ satisfies the linear constraints $Ax-s=0$. If the largest element of the residual vector $r=Ax-s$ is judged to be too large, the current basis is refactorized and the basic variables recomputed to satisfy the constraints more accurately. If $i<0$, the default value is used. If $i=0$, the value $i=99999999$ is used and effectively no checks are made.

‘Crash Option’int

Default $=2$

Note that this option does not apply when $start=\text{'W'}$ (see Parameters).

If $start=\text{'C'}$, an internal crash procedure is used to select an initial basis from various rows and columns of the constraint matrix $(A-I)$. The value of $i$ determines which rows and columns are initially eligible for the basis, and how many times the crash procedure is called. If $i=0$, the all-slack basis $B=-I$ is chosen. If $i=1$, the crash procedure is called once (looking for a triangular basis in all rows and columns of the linear constraint matrix $A$). If $i=2$, the crash procedure is called twice (looking at any equality constraints first followed by any inequality constraints). If $i<0$ or $i>2$, the default value is used.

If $i=1$ or $2$, certain slacks on inequality rows are selected for the basis first. (If $i=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.

‘Crash Tolerance’float

Default $=0.1$

This value allows the crash procedure to ignore certain ‘small’ nonzero elements in the constraint matrix $A$ while searching for a triangular basis. For each column of $A$, if $a_{max}$ is the largest element in the column, other nonzeros in that column are ignored if they are less than (or equal to) $a_{max}\times r$.

When $r>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 with more column variables and fewer (arbitrary) slacks. A feasible solution may be reached earlier for some problems. If $r<0$ or $r\ge 1$, the default value is used.

‘Defaults’valueless

This special keyword may be used to reset all options to their default values.

‘Expand Frequency’int

Default $=10000$

This option is part of an anti-cycling procedure (see Miscellaneous) designed to allow progress even on highly degenerate problems.

For LP problems, the strategy is to force a positive step at every iteration, at the expense of violating the constraints by a small amount. Suppose that the value of the option ‘Feasibility Tolerance’ is $\delta$. Over a period of $i$ iterations, the feasibility tolerance actually used by iqp_sparse (i.e., the working feasibility tolerance) increases from $0.5\delta$ to $\delta$ (in steps of $0.5\delta /i$).

For QP problems, the same procedure is used for iterations in which there is only one superbasic variable. (Cycling can only occur 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 the value of $i$ helps reduce the number of slightly infeasible nonbasic basic variables (most of which are eliminated during the resetting procedure). However, it also diminishes the freedom to choose a large pivot element (see the description of the option ‘Pivot Tolerance’).

If $i<0$, the default value is used. If $i=0$, the value $i=99999999$ is used and effectively no anti-cycling procedure is invoked.

‘Factorization Frequency’int

Default $=100$

If $i>0$, at most $i$ basis changes will occur between factorizations of the basis matrix. For LP problems, the basis factors are usually updated at every iteration. For QP problems, fewer basis updates will occur as the solution is approached. The number of iterations between basis factorizations will, therefore, increase. During these iterations a test is made regularly according to the value of option ‘Check Frequency’ to ensure that the linear constraints $Ax-s=0$ are satisfied. If necessary, the basis will be refactorized before the limit of $i$ updates is reached. If $i\le 0$, the default value is used.

‘Feasibility Tolerance’float

Default $=max({10}^{-6},\sqrt{ϵ})$

If $r\ge ϵ$, $r$ defines the maximum acceptable absolute violation in each constraint at a ‘feasible’ point (including slack variables). For example, if the variables and the coefficients in the linear constraints are of order unity, and the latter are correct to about five decimal digits, it would be appropriate to specify $r$ as ${10}^{-5}$. If $r<ϵ$, the default value is used.

iqp_sparse attempts to find a feasible solution before optimizing the objective function. If the sum of infeasibilities cannot be reduced to zero, the problem is assumed to be infeasible. Let Sinf be the corresponding sum of infeasibilities. 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. Note that the function does not attempt to find the minimum value of Sinf.

If the constraints and variables have been scaled (see the description of the option ‘Scale Option’), then feasibility is defined in terms of the scaled problem (since it is more likely to be meaningful).

‘Infinite Bound Size’float

Default $={10}^{20}$

If $r>0$, $r$ defines the ‘infinite’ bound $\text{bigbnd}$ in the definition of the problem constraints. Any upper bound greater than or equal to $\text{bigbnd}$ will be regarded as $+\infty$ (and similarly any lower bound less than or equal to $-\text{bigbnd}$ will be regarded as $-\infty$). If $r\le 0$, the default value is used.

‘Infinite Step Size’float

Default $=max(\text{bigbnd},{10}^{20})$

If $r>0$, $r$ specifies the magnitude of the change in variables that will be considered a step to an unbounded solution. (Note that an unbounded solution can occur only when the Hessian is not positive definite.) If the change in $x$ during an iteration would exceed the value of $r$, the objective function is considered to be unbounded below in the feasible region. If $r\le 0$, the default value is used.

‘Iteration Limit’int

Default $=max(50,5(n+m))$

The value of $i$ specifies the maximum number of iterations allowed before termination. Setting $i=0$ and $\text{‘Print Level'}>0$ means that the workspace needed to start solving the problem will be computed and printed, but no iterations will be performed. If $i<0$, the default value is used.

‘Iters’int

Default $=max(50,5(n+m))$

The value of $i$ specifies the maximum number of iterations allowed before termination. Setting $i=0$ and $\text{‘Print Level'}>0$ means that the workspace needed to start solving the problem will be computed and printed, but no iterations will be performed. If $i<0$, the default value is used.

‘Itns’int

Default $=max(50,5(n+m))$

The value of $i$ specifies the maximum number of iterations allowed before termination. Setting $i=0$ and $\text{‘Print Level'}>0$ means that the workspace needed to start solving the problem will be computed and printed, but no iterations will be performed. If $i<0$, the default value is used.

‘List’valueless

Option ‘List’ enables printing of each option specification as it is supplied. ‘Nolist’ suppresses this printing.

‘Nolist’valueless

Default

Option ‘List’ enables printing of each option specification as it is supplied. ‘Nolist’ suppresses this printing.

‘LU Factor Tolerance’float

Default $=100.0$

The values of $r_1$ and $r_2$ affect the stability and sparsity of the basis factorization $B=LU$, during refactorization and updates respectively. The lower triangular matrix $L$ is a product of matrices of the form

$$\begin{array}{c}\left(\begin{array}{cc}1& \\ \mu & 1\end{array}\right)\end{array}$$

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. For large and relatively dense problems, setting $r_1$ and $r_2$ to $25$ (say) may give a marked improvement in sparsity without impairing stability to a serious degree. Note that for band matrices it may be necessary to set $r_1$ in the range $1\le r_1<2$ in order to achieve stability. If $r_1<1$ or $r_2<1$, the default value is used.

‘LU Update Tolerance’float

Default $=10.0$

The values of $r_1$ and $r_2$ affect the stability and sparsity of the basis factorization $B=LU$, during refactorization and updates respectively. The lower triangular matrix $L$ is a product of matrices of the form

$$\begin{array}{c}\left(\begin{array}{cc}1& \\ \mu & 1\end{array}\right)\end{array}$$

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. For large and relatively dense problems, setting $r_1$ and $r_2$ to $25$ (say) may give a marked improvement in sparsity without impairing stability to a serious degree. Note that for band matrices it may be necessary to set $r_1$ in the range $1\le r_1<2$ in order to achieve stability. If $r_1<1$ or $r_2<1$, the default value is used.

‘LU Singularity Tolerance’float

Default $={ϵ}^{0.67}$

If $r>0$, $r$ defines the singularity tolerance used to guard against ill-conditioned basis matrices. Whenever the basis is refactorized, the diagonal elements of $U$ are tested as follows. If $\left|u_{jj}\right|\le r$ or $\left|u_{jj}\right|<r\times {max}_i\left|u_{ij}\right|$, the $j$th column of the basis is replaced by the corresponding slack variable. If $r\le 0$, the default value is used.

‘Minimize’valueless

Default

This option specifies the required direction of the optimization. It applies to both linear and nonlinear terms (if any) in the objective function. Note that if two problems are the same except that one minimizes $f\left(x\right)$ and the other maximizes $-f\left(x\right)$, their solutions will be the same but the signs of the dual variables ${\pi }_i$ and the reduced gradients $d_j$ (see The Main Iteration) will be reversed.

‘Maximize’valueless

This option specifies the required direction of the optimization. It applies to both linear and nonlinear terms (if any) in the objective function. Note that if two problems are the same except that one minimizes $f\left(x\right)$ and the other maximizes $-f\left(x\right)$, their solutions will be the same but the signs of the dual variables ${\pi }_i$ and the reduced gradients $d_j$ (see The Main Iteration) will be reversed.

‘Monitoring File’int

Default $=-1$

If $i\ge 0$ and $\text{‘Print Level'}>0$, monitoring information produced by iqp_sparse is sent to a file with logical unit number $i$. If $i<0$ and/or $\text{‘Print Level'}=0$, the default value is used and hence no monitoring information is produced.

‘Optimality Tolerance’float

Default $=max({10}^{-6},\sqrt{ϵ})$

If $r\ge ϵ$, $r$ is used to judge the size of the reduced gradients $d_j=g_j-{\pi }^T{a}_j$. By definition, the reduced gradients for basic variables are always zero. Optimality is declared if the reduced gradients for any nonbasic variables at their lower or upper bounds satisfy $-r\times max(1,\parallel \pi \parallel )\le d_j\le r\times max(1,\parallel \pi \parallel )$, and if $\left|d_j\right|\le r\times max(1,\parallel \pi \parallel )$ for any superbasic variables. If $r<ϵ$, the default value is used.

‘Partial Price’int

Default $=10$

Note that this option does not apply to QP problems.

This option is recommended for large FP or LP problems that have significantly more variables than constraints (i.e., $n\gg m$). It reduces the work required for each pricing operation (i.e., when a nonbasic variable is selected to enter the basis). If $i=1$, all columns of the constraint matrix $(A-I)$ are searched. If $i>1$, $A$ and $-I$ are partitioned to give $i$ roughly equal segments $A_{\text{j}},K_{\text{j}}$, for $\text{j}=1,2,\dots ,p$ (modulo $p$). If the previous pricing search was successful on $A_{j-1},K_{j-1}$, the next search begins on the segments $A_j,K_j$. 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 enter the basis. If nothing is found, the search continues on the next segments $A_{j+1},K_{j+1}$, and so on. If $i\le 0$, the default value is used.

‘Pivot Tolerance’float

Default $={ϵ}^{0.67}$

If $r>0$, $r$ is used to prevent columns entering the basis if they would cause the basis to become almost singular. If $r\le 0$, the default value is used.

‘Print Level’int

Default $=10$

The value of $i$ controls the amount of printout produced by iqp_sparse, as indicated below. A detailed description of the printed output is given in Further Comments (summary output at each iteration and the final solution) and Monitoring Information (monitoring information at each iteration). Note that the summary output will not exceed $80$ characters per line and that the monitoring information will not exceed $120$ characters per line. If $i<0$, the default value is used. The following printout is sent to the file object associated with the advisory I/O unit (see FileObjManager):

$i$	Output
$0$	No output.
$1$	The final solution only.
$5$	One line of summary output for each iteration (no printout of the final solution).
$\ge 10$	The final solution and one line of summary output for each iteration.

The following printout is sent to the logical unit number defined by the ‘Monitoring File’:

$i$	Output
$0$	No output.
$1$	The final solution only.
$5$	One long line of output for each iteration (no printout of the final solution).
$\ge 10$	The final solution and one long line of output for each iteration.
$\ge 20$	The final solution, one long line of output for each iteration, matrix statistics (initial status of rows and columns, number of elements, density, biggest and smallest elements, etc.), details of the scale factors resulting from the scaling procedure (if $\text{‘Scale Option'}=1$ or $2$), basis factorization statistics and details of the initial basis resulting from the crash procedure (if $start=\text{'C'}$; see Parameters).

If $\text{‘Print Level'}>0$ and the unit number defined by ‘Monitoring File’ is the advisory unit number, then the summary output is suppressed.

‘Rank Tolerance’float

Default $=100ϵ$

See above.

‘Scale Option’int

Default $=2$

This option enables you to scale the variables and constraints using an iterative procedure due to Fourer (see Hock and Schittkowski (1981)), which attempts to compute row scales $r_i$ and column scales $c_j$ such that the scaled matrix coefficients ${\overline{a}}_{ij}=a_{ij}\times \left(c_j/r_i\right)$ are as close as possible to unity. This may improve the overall efficiency of the function on some problems. (The lower and upper bounds on the variables and slacks for the scaled problem are redefined as ${\overline{l}}_j=l_j/c_j$ and ${\overline{u}}_j=u_j/c_j$ respectively, where $c_j\equiv r_{j-n}$ if $j>n$.)

If $i=0$, no scaling is performed. If $i=1$, all rows and columns of the constraint matrix $A$ are scaled. If $i=2$, an additional scaling is performed that may be helpful when the solution $x$ is large; it takes into account columns of $(A-I)$ that are fixed or have positive lower bounds or negative upper bounds. If $i<0$ or $i>2$, the default value is used.

‘Scale Tolerance’float

Default $=0.9$

Note that this option does not apply when $\text{‘Scale Option'}=0$.

If $0<r<1$, $r$ is used to control the number of scaling passes to be made through the constraint matrix $A$. At least $3$ (and at most $10$) passes will be made. More precisely, let $a_p$ denote the largest column ratio (i.e., $\frac{\text{‘biggest'}\text{element}}{\text{‘smallest'}\text{element}}$ in some sense) after the $p$th scaling pass through $A$. The scaling procedure is terminated if $a_p\ge a_{p-1}\times r$ for some $p\ge 3$. Thus, increasing the value of $r$ from $0.9$ to $0.99$ (say) will probably increase the number of passes through $A$. If $r\le 0$ or $r\ge 1$, the default value is used.

‘Superbasics Limit’int

Default $=min(n_H+1,n)$

Note that this option does not apply to FP or LP problems.

The value of $i$ specifies ‘how nonlinear’ you expect the QP problem to be. If $i\le 0$, the default value is used.

Raises

NagValueError

(errno $1$)

On entry, $strtgy=⟨value⟩$.

Constraint: $strtgy=0$, $1$, $2$ or $3$.

(errno $1$)

On entry, $mdepth=⟨value⟩$.

Constraint: $mdepth\ge 1$.

(errno $1$)

On entry, $\text{lintvr}=⟨value⟩$.

Constraint: $\text{lintvr}\ge 1$.

(errno $1$)

On entry, $\text{i}=⟨value⟩$, $istate[\text{i}-1]=⟨value⟩$.

Constraint: $0\le istate\left[\text{i}\right]\le 3$ with $start=\text{'W'}$.

(errno $1$)

On entry, $\text{i}=⟨value⟩$, $istate[\text{i}-1]=⟨value⟩$.

Constraint: $0\le istate\left[\text{i}\right]\le 5$ with $start=\text{'C'}$.

(errno $1$)

On entry, $\text{nname}=⟨value⟩$, $n=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $\text{nname}=1$ or $\text{nname}=n+m$.

(errno $1$)

On entry, $start=⟨value⟩$.

Constraint: $start=\text{'C'}$ or $\text{'W'}$.

(errno $1$)

On entry, $ka\left[\text{i}\right]=⟨value⟩$, $ka[\text{i}-1]=⟨value⟩$ $\text{i}=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $0\le ka\left[\text{i}\right]-ka[\text{i}-1]\le m$.

(errno $1$)

On entry, $\text{i}=⟨value⟩$ and $ka[\text{i}-1]=⟨value⟩$.

Constraint: $ka[\text{i}-1]\ge 1$.

(errno $1$)

On entry, $n=⟨value⟩$, $ka\left[n\right]=⟨value⟩$ and $\text{nnz}=⟨value⟩$.

Constraint: $ka\left[n\right]=\text{nnz}+1$.

(errno $1$)

On entry, $ka\left[0\right]=⟨value⟩$.

Constraint: $ka\left[0\right]=1$.

(errno $1$)

On entry, $\text{i}=⟨value⟩$, $ha[\text{i}-1]=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $1\le ha\left[\text{i}\right]\le m$.

(errno $1$)

On entry, $ncolh=⟨value⟩$ and $n=⟨value⟩$.

Constraint: $0\le ncolh\le n$.

(errno $1$)

On entry, $iobj=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $0\le iobj\le m$.

(errno $1$)

On entry, $\text{nnz}=⟨value⟩$, $n=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $0\le \text{nnz}\le n\times m$

(errno $1$)

On entry, $m=⟨value⟩$.

Constraint: $m>0$.

(errno $1$)

On entry, $n=⟨value⟩$.

Constraint: $n>0$.

(errno $2$)

No integer solutions found.

(errno $3$)

Need to increase depth, $mdepth=⟨value⟩$.

(errno $4$)

The problem is unbounded (or badly scaled).

(errno $5$)

The problem is infeasible.

(errno $6$)

Too many iterations. Try increasing Iteration Limit.

(errno $7$)

Reduced Hessian exceeds assigned dimension.

(errno $8$)

Hessian appears to be indefinite.

(errno $9$)

Invalid input argument for internal call to local optimizer.

(errno $10$)

Numerical error trying to satisfy constraints. The basis is very ill-conditioned.

(errno $13$)

Singular basis after $15$ attempts to factorize.

(errno $16$)

Unexpected error in NAG function – contact NAG.

Warns

NagAlgorithmicWarning

(errno $-1$)

Halted at your request.

Notes

No equivalent traditional C interface for this routine exists in the NAG Library.

iqp_sparse is designed to obtain integer solutions to a class of quadratic programming problems addressed by opt.qpconvex1_sparse_solve. Specifically it solves the following problem:

$$\begin{array}{c}\begin{array}{c}{minimize}_{x\in R^n}f\left(x\right)\text{subject to}l\le \left\{\begin{array}{c}x\\ Ax\end{array}\right\}\le u\text{,}\end{array}\end{array}$$

where $x={(x_1,x_2,\dots ,x_n)}^T$ is a set of variables (some of which may be required to be integer), $A$ is an $m\times n$ matrix and the objective function $f\left(x\right)$ may be specified in a variety of ways depending upon the particular problem to be solved. The option ‘Maximize’ may be used to specify an alternative problem in which $f\left(x\right)$ is maximized. The possible forms for $f\left(x\right)$ are listed in Table [label omitted], in which the prefixes LP and QP stand for ‘linear programming’ and ‘quadratic programming’ respectively, $c$ is an $n$-element vector and $H$ is the $n\times n$ second-derivative matrix ${\nabla }^{2}f\left(x\right)$ (the Hessian matrix).

Problem type	Objective function $f\left(x\right)$	Hessian matrix $H$
LP	$c^{T}x$	Not applicable
QP	$c^{T}x+\frac{1}{2}{x}^{T}Hx$	Symmetric positive semidefinite

For LP and QP problems, the unique global minimum value of $f\left(x\right)$ is found. For QP problems, you must also provide a function that computes $Hx$ for any given vector $x$. ($H$ need not be stored explicitly.)

(It is not expected that the feasibility problem of opt.qpconvex1_sparse_solve would be relevant here.)

The function employs a ‘Branch and Bound’ technique to enforce the integer constraints. In this technique the problem is first solved without the integer constraints. If a variable is found to be non-integral when it is required to have an integer value then two additional problems are constructed. One bounds the variable above by the nearest integer value below the optimal value previously obtained. The second problem is formed by bounding the variable below by the nearest integer value above the optimal value. This process is continued until an integer solution is found. At this point you may elect to stop, or may continue to search for better integer solutions by examining any other sub-problems that remain to be explained.

In practice the function tries to compute an integer solution as quickly as possible using a depth-first approach, since this helps determine a realistic cut-off value. If we have a cut-off value, say the value of the function at this first integer solution, and any sub-problem, $W$ say, has a solution value greater than this cut-off value, then subsequent sub-problems of $W$ must have solutions greater than the value of the solution at $W$ and, therefore, need not be computed. Thus a knowledge of a good cut-off value can result in fewer sub-problems being solved and thus speed up the operation of the function. (See the description of $monit$ in Parameters for details of how you can supply your own cut-off value.)

Each sub-problem is solved using opt.qpconvex1_sparse_solve. You are referred to the function document for opt.qpconvex1_sparse_solve for details of the algorithm used.

References

Gill, P E, Hammarling, S, Murray, W, Saunders, M A and Wright, M H, 1986, Users’ guide for LSSOL (Version 1.0), Report SOL 86-1, Department of Operations Research, Stanford University

Gill, P E and Murray, W, 1978, Numerically stable methods for quadratic programming, Math. Programming (14), 349–372

Gill, P E, Murray, W, Saunders, M A and Wright, M H, 1986, Some theoretical properties of an augmented Lagrangian merit function, Report SOL, 86–6R, Department of Operations Research, Stanford University

Gill, P E, Murray, W, Saunders, M A and Wright, M H, 1989, A practical anti-cycling procedure for linearly constrained optimization, Math. Programming (45), 437–474

Gill, P E, Murray, W, Saunders, M A and Wright, M H, 1991, Inertia-controlling methods for general quadratic programming, SIAM Rev. (33), 1–36

Hock, W and Schittkowski, K, 1981, Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems (187), Springer–Verlag

Lawson, C L, Hanson, R J, Kincaid, D R and Krogh, F T, 1979, Basic linear algebra supbrograms for Fortran usage, ACM Trans. Math. Software (5), 308–325

Murtagh, B A and Saunders, M A, 1983, MINOS 5.0 user’s guide, Report SOL 83-20, Department of Operations Research, Stanford University