naginterfaces.library.glopt.nlp_​multistart_​sqp

naginterfaces.library.glopt.nlp_multistart_sqp(n, ncnln, bl, bu, objfun, npts, repeat, nb, comm, a=None, confun=None, start=None, data=None, io_manager=None, spiked_sorder='C')

nlp_multistart_sqp is designed to find the global minimum of an arbitrary smooth function subject to constraints (which may include simple bounds on the variables, linear constraints and smooth nonlinear constraints) by generating a number of different starting points and performing a local search from each using sequential quadratic programming.

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

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

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/e05/e05ucf.html

Parameters

nint

$n$, the number of variables.

ncnlnint

$n_N$, the number of nonlinear constraints.

blfloat, array-like, shape $(n+\text{nclin}+ncnln)$

$bl$ must contain the lower bounds for all the constraints.

bufloat, array-like, shape $(n+\text{nclin}+ncnln)$

$bu$ must contain the upper bounds for all the constraints.

objfuncallable (objf, objgrd) = objfun(mode, x, objgrd, nstate, data=None)

$objfun$ must calculate the objective function $F\left(x\right)$ and (optionally) its gradient $g\left(x\right)=\frac{\partial F}{\partial x}$ for a specified $n$-vector $x$.

Parameters

modeint

Indicates which values must be assigned during each call of $objfun$. Only the following values need be assigned:

$mode=0$

$objf$.

$mode=1$

All available elements of $objgrd$.

$mode=2$

$objf$ and all available elements of $objgrd$.

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

$x$, the vector of variables at which the objective function and/or all available elements of its gradient are to be evaluated.

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

The elements of $objgrd$ are set to special values which enable nlp_multistart_sqp to detect whether they are changed by $objfun$.

nstateint

If $nstate=1$ then nlp_multistart_sqp is calling $objfun$ for the first time on the current local optimization problem. This argument setting allows you to save computation time if certain data must be calculated only once.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

objffloat

If $mode=0$ or $2$, $objf$ must be set to the value of the objective function at $x$.

objgrdfloat, array-like, shape $\left(n\right)$

If $mode=1$ or $2$, $objgrd$ must return the available elements of the gradient evaluated at $x$.

nptsint

The number of different starting points to be generated and used. The more points used, the more likely that the best returned solution will be a global minimum.

repeatbool

Is passed as an argument to $start$ and may be used to initialize a random number generator to a repeatable, or non-repeatable, sequence.

nbint

The number of solutions to be returned. The function saves up to $nb$ local minima ordered by increasing value of the final objective function. If the defining criterion for ‘best solution’ is only that the value of the objective function is as small as possible then $nb$ should be set to $1$. However, if you want to look at other solutions that may have desirable properties then setting $nb>1$ will produce $nb$ local minima, ordered by increasing value of their objective functions at the minima.

commdict, communication object, modified in place

Communication structure.

This argument must have been initialized by a prior call to optset().

aNone or float, array-like, shape $(\text{nclin},:)$, optional

Note: the required extent for this argument in dimension 2 is determined as follows: if $\text{nclin}>0$: $n$; otherwise: $1$.

The matrix $A_L$ of general linear constraints in (1). That is, the $\text{i}$th row contains the coefficients of the $\text{i}$th general linear constraint, for $\text{i}=1,2,\dots ,\text{nclin}$.

confunNone or callable (c, cjsl) = confun(mode, needc, x, cjsl, nstate, data=None), optional

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

$confun$ must calculate the vector $c\left(x\right)$ of nonlinear constraint functions and (optionally) its Jacobian ($=\frac{\partial c}{\partial x}$) for a specified $n$-element vector $x$. If there are no nonlinear constraints (i.e., $ncnln=0$), $confun$ will never be called by nlp_multistart_sqp and $confun$ may be None. If there are nonlinear constraints, the first call to $confun$ will occur before the first call to $objfun$.

Parameters

modeint

Indicates which values must be assigned during each call of $confun$. Only the following values need be assigned, for each value of $i$ such that $needc[i-1]>0$:

$mode=0$

$c[i-1]$.

$mode=1$

All available elements in the $i$th row of $cjsl$.

$mode=2$

$c[i-1]$ and all available elements in the $i$th row of $cjsl$.

needcint, ndarray, shape $\left(\text{ncnln}\right)$

The indices of the elements of $c$ and/or $cjsl$ that must be evaluated by $confun$. If $needc[i-1]>0$, $c[i-1]$ and/or the available elements of the $i$th row of $cjsl$ (see argument $mode$) must be evaluated at $x$.

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

$x$, the vector of variables at which the constraint functions and/or the available elements of the constraint Jacobian are to be evaluated.

cjslfloat, ndarray, shape $(\text{ncnln},n)$

$cjsl$ may be regarded as a two-dimensional ‘slice’ of the three-dimensional array $cjac$ of nlp_multistart_sqp.

Unless $\text{‘Derivative Level'}=2$ or $3$ (the default setting is $\text{‘Derivative Level'}=3$), the elements of $cjsl$ are set to special values which enable nlp_multistart_sqp to detect whether they are changed by $confun$.

nstateint

If $nstate=1$ then nlp_multistart_sqp is calling $confun$ for the first time on the current local optimization problem. This argument setting allows you to save computation time if certain data must be calculated only once.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

cfloat, array-like, shape $\left(\text{ncnln}\right)$

If $needc[k-1]>0$ and $mode=0$ or $2$, $c[k-1]$ must contain the value of $c_k\left(x\right)$. The remaining elements of $c$, corresponding to the non-positive elements of $needc$, need not be set.

cjslfloat, array-like, shape $(\text{ncnln},n)$

If $needc[k-1]>0$ and $mode=1$ or $2$, the $k$th row of $cjsl$ must contain the available elements of the vector $\nabla c_k$ given by

$$\nabla c_k={(\frac{\partial c_k}{\partial x_1},\frac{\partial c_k}{\partial x_2},\dots ,\frac{\partial c_k}{\partial x_n})}^T\text{,}$$

where $\frac{\partial c_k}{\partial x_j}$ is the partial derivative of the $k$th constraint with respect to the $j$th variable, evaluated at the point $x$. See also the argument $nstate$. The remaining rows of $cjsl$, corresponding to non-positive elements of $needc$, need not be set.

If all elements of the constraint Jacobian are known (i.e., $\text{‘Derivative Level'}=2$ or $3$), any constant elements may be assigned to $cjsl$ one time only at the start of each local optimization.

An element of $cjsl$ that is not subsequently assigned in $confun$ will retain its initial value throughout the local optimization.

Constant elements may be loaded into $cjsl$ during the first call to $confun$ for the local optimization (signalled by the value $nstate=1$).

The ability to preload constants is useful when many Jacobian elements are identically zero, in which case $cjsl$ may be initialized to zero and nonzero elements may be reset by $confun$.

Note that constant nonzero elements do affect the values of the constraints.

Thus, if $cjsl[k-1,j-1]$ is set to a constant value, it need not be reset in subsequent calls to $confun$, but the value $cjsl[k-1,j-1]\times x[j-1]$ must nonetheless be added to $c[k-1]$.

For example, if $cjsl[0,0]=2$ and $cjsl[0,1]=-5$ then the term $2\times x\left[0\right]-5\times x\left[1\right]$ must be included in the definition of $c\left[0\right]$.

It must be emphasized that, if $\text{‘Derivative Level'}=0$ or $1$, unassigned elements of $cjsl$ are not treated as constant; they are estimated by finite differences, at nontrivial expense.

If you do not supply a value for the option ‘Difference Interval’, an interval for each element of $x$ is computed automatically at the start of each local optimization.

The automatic procedure can usually identify constant elements of $cjsl$, which are then computed once only by finite differences.

startNone or callable quas = start(quas, repeat, bl, bu, data=None), optional

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

$start$ must calculate the $npts$ starting points to be used by the local optimizer.

If you do not wish to write a function specific to your problem then None may be used. In this case, a default function uses the NAG quasi-random number generators to distribute starting points uniformly across the domain.

It is affected by the value of $repeat$.

Parameters

quasfloat, ndarray, shape $(n,\text{npts})$

All elements of $quas$ will have been set to zero, so only nonzero values need be set subsequently.

repeatbool

Specifies whether a repeatable or non-repeatable sequence of points are to be generated.

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

The lower bounds on the variables. These may be used to ensure that the starting points generated in some sense ‘cover’ the region, but there is no requirement that a starting point be feasible.

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

The upper bounds on the variables. (See $bl$.)

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

quasfloat, array-like, shape $(n,\text{npts})$

Must contain the starting points for the $npts$ local minimizations, i.e., $quas[j-1,i-1]$ must contain the $j$th component of the $i$th starting point.

dataarbitrary, optional

User-communication data for callback functions.

io_managerFileObjManager, optional

Manager for I/O in this routine.

spiked_sorderstr, optional

If $a$ is spiked (i.e., has unit extent in all but one dimension, or has size $1$), $spiked\_sorder$ selects the storage order to associate with it in the NAG Engine:

spiked_sorder = $\text{'C'}$

row-major storage will be used;

spiked_sorder = $\text{'F'}$

column-major storage will be used.

Two-dimensional arrays returned from callback functions in this routine must then use the same storage order.

Returns

xfloat, ndarray, shape $(n,nb)$

$x[\text{j}-1,i-1]$ contains the final estimate of the $i$th solution, for $\text{j}=1,2,\dots ,n$.

objffloat, ndarray, shape $\left(nb\right)$

$objf[i-1]$ contains the value of the objective function at the final iterate for the $i$th solution.

objgrdfloat, ndarray, shape $(n,nb)$

$objgrd[\text{j}-1,i-1]$ contains the gradient of the objective function for the $i$th solution at the final iterate (or its finite difference approximation), for $\text{j}=1,2,\dots ,n$.

iteraint, ndarray, shape $\left(nb\right)$

$itera[i-1]$ contains the number of major iterations performed to obtain the $i$th solution. If less than $nb$ solutions are returned then $itera[nb-1]$ contains the number of starting points that have resulted in a converged solution. If this is close to $npts$ then this might be indicative that fewer than $nb$ local minima exist.

cNone or float, ndarray, shape $(ncnln,nb)$

If $ncnln>0$, $c[\text{j}-1,\text{i}-1]$ contains the value of the $\text{j}$th nonlinear constraint function $c_{\text{j}}$ at the final iterate, for the $\text{i}$th solution, for $\text{j}=1,2,\dots ,ncnln$.

If $ncnln=0$, $c$ is returned as None.

cjacNone or float, ndarray, shape $(ncnln,:,nb)$

If $ncnln>0$, $cjac$ contains the Jacobian matrices of the nonlinear constraint functions at the final iterate for each of the returned solutions, i.e., $cjac[\text{k}-1,\text{j}-1,i-1]$ contains the partial derivative of the $\text{k}$th constraint function with respect to the $\text{j}$th variable, for $\text{j}=1,2,\dots ,n$, for $\text{k}=1,2,\dots ,ncnln$, for the $i$th solution. (See the discussion of argument $cjsl$ under $confun$.)

If $ncnln=0$, $cjac$ is returned as None.

rfloat, ndarray, shape $(n,n,nb)$

For each of the $nb$ solutions $r$ will contain a form of the Hessian; for the $i$th returned solution $r[\text{ldr},\text{sdr},i]$ contains the Hessian that would be returned from the local minimizer. If $\text{‘Hessian'}=\text{'NO'}$, the default, each $r[\text{ldr},\text{sdr},i]$ contains the upper triangular Cholesky factor $R$ of $Q^{T}HQ$, an estimate of the transformed and reordered Hessian of the Lagrangian at $x$. If $\text{‘Hessian'}=\text{'YES'}$, $r[\text{ldr},\text{sdr},i]$ contains the upper triangular Cholesky factor $R$ of $H$, the approximate (untransformed) Hessian of the Lagrangian, with the variables in the natural order.

clamdafloat, ndarray, shape $(n+\text{nclin}+ncnln,nb)$

The values of the QP multipliers from the last QP subproblem solved for the $i$th solution. $clamda[j-1,i-1]$ should be non-negative if $istate[j-1,i-1]=1$ and non-positive if $istate[j-1,i-1]=2$.

istateint, ndarray, shape $(n+\text{nclin}+ncnln,nb)$

$istate[j-1,i-1]$ contains the status of the constraints in the QP working set for the $i$th solution. The significance of each possible value of $istate[j-1,i-1]$ is as follows:

$istate[j-1,i-1]$	Meaning
$0$	The constraint is satisfied to within the feasibility tolerance, but is not in the QP working set.
$1$	This inequality constraint is included in the QP working set at its lower bound.
$2$	This inequality constraint is included in the QP working set at its upper bound.
$3$	This constraint is included in the QP working set as an equality. This value of $istate$ can occur only when $bl[j-1]=bu[j-1]$.

infoint, ndarray, shape $\left(nb\right)$

$info[i-1]$ contains one of $0$, $1$ or $6$. Please see the description of each corresponding value of $\text{errno}$ on exit from opt.nlp1_solve for detailed explanations of these exit values. As usual $0$ denotes success.

If $errno$ = 8 on exit, then not all $nb$ solutions have been found, and $info[nb-1]$ contains the number of solutions actually found.

Other Parameters

‘Punch Unit’int

Default $=6$

This option allows you to send information arising from an appropriate setting of ‘Out_Level’ to be sent to the Fortran unit number defined by ‘Punch Unit’. If you wish this file to be different to the standard output unit where other output is displayed then this file should be attached by calling the FileObjManager method unit_from_fileobj() prior to calling nlp_multistart_sqp.

‘Out_Level’int

Default $=0$

This option defines the amount of extra information to be sent to the Fortran unit number defined by ‘Punch Unit’. The possible choices for $i$ are the following:

$i$	Meaning
0	No extra output.
1	Updated solutions only. This is useful during long runs to observe progress.
2	Successful start points only. This is useful to save the starting points that gave rise to the final solution.
3	Both updated solutions and successful start points.

‘Central Difference Interval’float

Default values are computed

If the algorithm switches to central differences because the forward-difference approximation is not sufficiently accurate, the value of $r$ is used as the difference interval for every element of $x$. The switch to central differences is indicated by C at the end of each line of intermediate printout produced by the major iterations (see Further Comments). The use of finite differences is discussed further under the option ‘Difference Interval’.

If you supply a value for this option, a small value between $0.0$ and $1.0$ is appropriate.

‘Crash Tolerance’float

Default $=0.01$

This value is used when nlp_multistart_sqp selects an initial working set. If $0\le r\le 1$, the initial working set will include (if possible) bounds or general inequality constraints that lie within $r$ of their bounds. In particular, a constraint of the form $a_j^{T}x\ge l$ will be included in the initial working set if $|a_j^{T}x-l|\le r(1+\left|l\right|)$. If $r<0$ or $r>1$, the default value is used.

‘Defaults’valueless

This special keyword is used to reset all options to their default values, and any random state stored in the array $\text{comm}$ will be destroyed.

Any option value given with this keyword will be ignored. This option cannot be queried or got.

‘Derivative Level’int

Default $=3$

This argument indicates which derivatives are provided in functions $objfun$ and $confun$. The possible choices for $i$ are the following.

$i$	Meaning
3	All elements of the objective gradient and the constraint Jacobian are provided.
2	All elements of the constraint Jacobian are provided, but some elements of the objective gradient are not specified.
1	All elements of the objective gradient are provided, but some elements of the constraint Jacobian are not specified.
0	Some elements of both the objective gradient and the constraint Jacobian are not specified.

The value $i=3$ should be used whenever possible, since nlp_multistart_sqp is more reliable (and will usually be more efficient) when all derivatives are exact.

If $i=0$ or $2$, nlp_multistart_sqp will estimate the unspecified elements of the objective gradient, using finite differences. The computation of finite difference approximations usually increases the total run-time, since a call to $objfun$ is required for each unspecified element. Furthermore, less accuracy can be attained in the solution (see Module 8 of Gill et al. (1981), for a discussion of limiting accuracy).

If $i=0$ or $1$, nlp_multistart_sqp will approximate unspecified elements of the constraint Jacobian. One call to $confun$ is needed for each variable for which partial derivatives are not available. For example, if the Jacobian has the form

$$\begin{array}{c}\left(\begin{array}{cccc}\text{*}& \text{*}& \text{*}& \text{*}\\ \text{*}& \text{?}& \text{?}& \text{*}\\ \text{*}& \text{*}& \text{?}& \text{*}\\ \text{*}& \text{*}& \text{*}& \text{*}\end{array}\right)\end{array}$$

where ‘$\ast$’ indicates an element provided by you and ‘?’ indicates an unspecified element, nlp_multistart_sqp will call $confun$ twice: once to estimate the missing element in column 2, and again to estimate the two missing elements in column $3$. (Since columns $1$ and $4$ are known, they require no calls to $confun$.)

At times, central differences are used rather than forward differences, in which case twice as many calls to $objfun$ and $confun$ are needed. (The switch to central differences is not under your control.)

If $i<0$ or $i>3$, the default value is used.

‘Difference Interval’float

Default values are computed

This option defines an interval used to estimate derivatives by finite differences in the following circumstances:

1. For verifying the objective and/or constraint gradients (see the description of the option ‘Verify’).

2. For estimating unspecified elements of the objective gradient or the constraint Jacobian.

In general, a derivative with respect to the $j$th variable is approximated using the interval ${\delta }_j$, where ${\delta }_j=r(1+\left|{\hat{x}}_j\right|)$, with $\hat{x}$ the first point feasible with respect to the bounds and linear constraints. If the functions are well scaled, the resulting derivative approximation should be accurate to $O\left(r\right)$. See Gill et al. (1981) for a discussion of the accuracy in finite difference approximations.

If a difference interval is not specified, a finite difference interval will be computed automatically for each variable by a procedure that requires up to six calls of $confun$ and $objfun$ for each element. This option is recommended if the function is badly scaled or you wish to have nlp_multistart_sqp determine constant elements in the objective and constraint gradients (see the descriptions of $confun$ and $objfun$ in Parameters).

If you supply a value for this option, a small value between $0.0$ and $1.0$ is appropriate.

‘Feasibility Tolerance’float

Default $=\sqrt{ϵ}$

The scalar $r$ defines the maximum acceptable absolute violations in linear and nonlinear constraints at a ‘feasible’ point; i.e., a constraint is considered satisfied if its violation does not exceed $r$. If $r<ϵ$ or $r\ge 1$, the default value is used. Using this keyword sets both options ‘Linear Feasibility Tolerance’ and ‘Nonlinear Feasibility Tolerance’ to $r$, if $ϵ\le r<1$. (Additional details are given under the descriptions of these options.)

‘Function Precision’float

Default $={ϵ}^{0.9}$

This argument defines ${ϵ}_r$, which is intended to be a measure of the accuracy with which the problem functions $F\left(x\right)$ and $c\left(x\right)$ can be computed. If $r<ϵ$ or $r\ge 1$, the default value is used.

The value of ${ϵ}_r$ should reflect the relative precision of $1+\left|F\left(x\right)\right|$; i.e., ${ϵ}_r$ acts as a relative precision when $\left|F\right|$ is large, and as an absolute precision when $\left|F\right|$ is small. For example, if $F\left(x\right)$ is typically of order $1000$ and the first six significant digits are known to be correct, an appropriate value for ${ϵ}_r$ would be ${10}^{-6}$. In contrast, if $F\left(x\right)$ is typically of order ${10}^{-4}$ and the first six significant digits are known to be correct, an appropriate value for ${ϵ}_r$ would be ${10}^{-10}$. The choice of ${ϵ}_r$ can be quite complicated for badly scaled problems; see Module 8 of Gill et al. (1981) for a discussion of scaling techniques. The default value is appropriate for most simple functions that are computed with full accuracy. However, when the accuracy of the computed function values is known to be significantly worse than full precision, the value of ${ϵ}_r$ should be large enough so that nlp_multistart_sqp will not attempt to distinguish between function values that differ by less than the error inherent in the calculation.

‘Hessian’str

Default $=NO$

This option controls the contents of the upper triangular matrix $R$ (see Parameters). nlp_multistart_sqp works exclusively with the transformed and reordered Hessian $H_Q$ (6), and hence extra computation is required to form the Hessian itself. If $\text{‘Hessian'}=\text{'NO'}$, $r$ contains the Cholesky factor of the transformed and reordered Hessian. If $\text{‘Hessian'}=\text{'YES'}$, the Cholesky factor of the approximate Hessian itself is formed and stored in $r$.

‘Infinite Bound Size’float

Default $={10}^{20}$

This defines the ‘infinite’ bound $\text{infbnd}$ in the definition of the problem constraints. Any upper bound greater than or equal to $\text{infbnd}$ will be regarded as $\infty$ (and similarly any lower bound less than or equal to $-\text{infbnd}$ will be regarded as $-\infty$).

‘Infinite Step Size’float

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

If $r>0$, $r$ specifies the magnitude of the change in variables that is treated as a step to an unbounded solution. 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.

‘Line Search Tolerance’float

Default $=0.9$

The value $r$ ($0\le r<1$) controls the accuracy with which the step $\alpha$ taken during each iteration approximates a minimum of the merit function along the search direction (the smaller the value of $r$, the more accurate the linesearch). The default value $r=0.9$ requests an inaccurate search, and is appropriate for most problems, particularly those with any nonlinear constraints.

If there are no nonlinear constraints, a more accurate search may be appropriate when it is desirable to reduce the number of major iterations – for example, if the objective function is cheap to evaluate, or if a substantial number of derivatives are unspecified. If $r<0$ or $r\ge 1$, the default value is used.

‘Linear Feasibility Tolerance’float

Default $=\sqrt{ϵ}$

The default value of $r_2$ is ${ϵ}^{0.33}$ if $\text{‘Derivative Level'}=0$ or $1$, and $\sqrt{ϵ}$ otherwise.

The scalars $r_1$ and $r_2$ define the maximum acceptable absolute violations in linear and nonlinear constraints at a ‘feasible’ point; i.e., a linear constraint is considered satisfied if its violation does not exceed $r_1$, and similarly for a nonlinear constraint and $r_2$. If $r_{\text{m}}<ϵ$ or $r_{\text{m}}\ge 1$, the default value is used, for $\text{m}=1,2,\dots ,2$.

On entry to nlp_multistart_sqp, an iterative procedure is executed in order to find a point that satisfies the linear constraints and bounds on the variables to within the tolerance $r_1$. All subsequent iterates will satisfy the linear constraints to within the same tolerance (unless $r_1$ is comparable to the finite difference interval).

For nonlinear constraints, the feasibility tolerance $r_2$ defines the largest constraint violation that is acceptable at an optimal point. Since nonlinear constraints are generally not satisfied until the final iterate, the value of option ‘Nonlinear Feasibility Tolerance’ acts as a partial termination criterion for the iterative sequence generated by nlp_multistart_sqp (see the discussion of option ‘Optimality Tolerance’).

These tolerances should reflect the precision of the corresponding constraints. For example, if the variables and the coefficients in the linear constraints are of order unity, and the latter are correct to about $6$ decimal digits, it would be appropriate to specify $r_1$ as ${10}^{-6}$.

‘Nonlinear Feasibility Tolerance’float

Default $={ϵ}^{0.33}$ or $\sqrt{ϵ}$

The default value of $r_2$ is ${ϵ}^{0.33}$ if $\text{‘Derivative Level'}=0$ or $1$, and $\sqrt{ϵ}$ otherwise.

The scalars $r_1$ and $r_2$ define the maximum acceptable absolute violations in linear and nonlinear constraints at a ‘feasible’ point; i.e., a linear constraint is considered satisfied if its violation does not exceed $r_1$, and similarly for a nonlinear constraint and $r_2$. If $r_{\text{m}}<ϵ$ or $r_{\text{m}}\ge 1$, the default value is used, for $\text{m}=1,2,\dots ,2$.

On entry to nlp_multistart_sqp, an iterative procedure is executed in order to find a point that satisfies the linear constraints and bounds on the variables to within the tolerance $r_1$. All subsequent iterates will satisfy the linear constraints to within the same tolerance (unless $r_1$ is comparable to the finite difference interval).

For nonlinear constraints, the feasibility tolerance $r_2$ defines the largest constraint violation that is acceptable at an optimal point. Since nonlinear constraints are generally not satisfied until the final iterate, the value of option ‘Nonlinear Feasibility Tolerance’ acts as a partial termination criterion for the iterative sequence generated by nlp_multistart_sqp (see the discussion of option ‘Optimality Tolerance’).

These tolerances should reflect the precision of the corresponding constraints. For example, if the variables and the coefficients in the linear constraints are of order unity, and the latter are correct to about $6$ decimal digits, it would be appropriate to specify $r_1$ as ${10}^{-6}$.

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

‘Major Iteration Limit’int

Default $=max(50,3(n+n_L)+10n_N)$

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

‘Iteration Limit’int

Default $=max(50,3(n+n_L)+10n_N)$

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

‘Iters’int

Default $=max(50,3(n+n_L)+10n_N)$

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

‘Itns’int

Default $=max(50,3(n+n_L)+10n_N)$

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

‘Major Print Level’int

Default $=0$

The value of $i$ controls the amount of printout produced by the major iterations of nlp_multistart_sqp, as indicated below. A detailed description of the printed output is given in Further Comments (summary output at each major iteration and the final solution) and Monitoring Information (monitoring information at each major iteration). (See also the description of the option ‘Minor Print Level’.)

The following printout is sent to the file object associated with the advisory I/O unit (see FileObjManager):

$i$	Output
$0$	No output.

For the other values described below, the arguments used by opt.nlp1_solve are displayed in addition to intermediate and final output.

$i$	Output
$1$	The final solution only.
$5$	One line of summary output ($<80$ characters; see Further Comments) for each major iteration (no printout of the final solution).
$\ge 10$	The final solution and one line of summary output for each major iteration.

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

$i$	Output
$<5$	No output.
$\ge 5$	One long line of output ($>80$ characters; see Monitoring Information) for each major iteration (no printout of the final solution).
$\ge 20$	At each major iteration, the objective function, the Euclidean norm of the nonlinear constraint violations, the values of the nonlinear constraints (the vector $c$), the values of the linear constraints (the vector $A_{L}x$), and the current values of the variables (the vector $x$).
$\ge 30$	At each major iteration, the diagonal elements of the matrix $T$ associated with the $TQ$ factorization (5) (see Overview) of the QP working set, and the diagonal elements of $R$, the triangular factor of the transformed and reordered Hessian (6) (see Overview).

If $\text{‘Major Print Level'}\ge 5$ and the unit number defined by the option ‘Monitoring File’ is the advisory unit number, then the summary output for each major iteration is suppressed.

‘Print Level’int

Default $=0$

The value of $i$ controls the amount of printout produced by the major iterations of nlp_multistart_sqp, as indicated below. A detailed description of the printed output is given in Further Comments (summary output at each major iteration and the final solution) and Monitoring Information (monitoring information at each major iteration). (See also the description of the option ‘Minor Print Level’.)

The following printout is sent to the file object associated with the advisory I/O unit (see FileObjManager):

$i$	Output
$0$	No output.

For the other values described below, the arguments used by opt.nlp1_solve are displayed in addition to intermediate and final output.

$i$	Output
$1$	The final solution only.
$5$	One line of summary output ($<80$ characters; see Further Comments) for each major iteration (no printout of the final solution).
$\ge 10$	The final solution and one line of summary output for each major iteration.

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

$i$	Output
$<5$	No output.
$\ge 5$	One long line of output ($>80$ characters; see Monitoring Information) for each major iteration (no printout of the final solution).
$\ge 20$	At each major iteration, the objective function, the Euclidean norm of the nonlinear constraint violations, the values of the nonlinear constraints (the vector $c$), the values of the linear constraints (the vector $A_{L}x$), and the current values of the variables (the vector $x$).
$\ge 30$	At each major iteration, the diagonal elements of the matrix $T$ associated with the $TQ$ factorization (5) (see Overview) of the QP working set, and the diagonal elements of $R$, the triangular factor of the transformed and reordered Hessian (6) (see Overview).

If $\text{‘Major Print Level'}\ge 5$ and the unit number defined by the option ‘Monitoring File’ is the advisory unit number, then the summary output for each major iteration is suppressed.

‘Minor Iteration Limit’int

Default $=max(50,3(n+n_L+n_N))$

The value of $i$ specifies the maximum number of iterations for finding a feasible point with respect to the bounds and linear constraints (if any). The value of $i$ also specifies the maximum number of minor iterations for the optimality phase of each QP subproblem. If $i\le 0$, the default value is used.

‘Minor Print Level’int

Default $=0$

The value of $i$ controls the amount of printout produced by the minor iterations of nlp_multistart_sqp (i.e., the iterations of the quadratic programming algorithm), as indicated below. A detailed description of the printed output is given in Further Comments (summary output at each minor iteration and the final QP solution) and Monitoring Information (monitoring information at each minor iteration). (See also the description of the option ‘Major Print Level’.) 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 QP solution only.
$5$	One line of summary output ($<80$ characters; see Further Comments) for each minor iteration (no printout of the final QP solution).
$\ge 10$	The final QP solution and one line of summary output for each minor iteration.

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

$i$	Output
$<5$	No output.
$\ge 5$	One long line of output ($>80$ characters; see Further Comments) for each minor iteration (no printout of the final QP solution).
$\ge 20$	At each minor iteration, the current estimates of the QP multipliers, the current estimate of the QP search direction, the QP constraint values, and the status of each QP constraint.
$\ge 30$	At each minor iteration, the diagonal elements of the matrix $T$ associated with the $TQ$ factorization (5) (see Overview) of the QP working set, and the diagonal elements of the Cholesky factor $R$ of the transformed Hessian (6) (see Overview).

If $\text{‘Minor Print Level'}\ge 5$ and the unit number defined by the option ‘Monitoring File’ is the advisory unit number, the summary output for each minor iteration is suppressed.

‘Monitoring File’int

Default $=-1$

If $i\ge 0$ and $\text{‘Major Print Level'}\ge 5$ or $i\ge 0$ and $\text{‘Minor Print Level'}\ge 5$, monitoring information produced by nlp_multistart_sqp at every iteration is sent to a file with logical unit number $i$. If $i<0$ and/or $\text{‘Major Print Level'}<5$ and $\text{‘Minor Print Level'}<5$, no monitoring information is produced.

‘Optimality Tolerance’float

Default $={ϵ}_R^{0.8}$

The argument $r$ (${ϵ}_R\le r<1$) specifies the accuracy to which you wish the final iterate to approximate a solution of the problem. Broadly speaking, $r$ indicates the number of correct figures desired in the objective function at the solution. For example, if $r$ is ${10}^{-6}$ and nlp_multistart_sqp terminates successfully, the final value of $F$ should have approximately six correct figures. If $r<{ϵ}_r$ or $r\ge 1$, the default value is used.

nlp_multistart_sqp will terminate successfully if the iterative sequence of $x$ values is judged to have converged and the final point satisfies the first-order Kuhn–Tucker conditions (see Overview). The sequence of iterates is considered to have converged at $x$ if

$$\alpha \parallel p\parallel \le \sqrt{r}(1+\parallel x\parallel )\text{,}$$

where $p$ is the search direction and $\alpha$ the step length from (3). An iterate is considered to satisfy the first-order conditions for a minimum if

$$\Vert Z^T{g}_{FR}\Vert \le \sqrt{r}(1+max(1+\left|F\left(x\right)\right|,\parallel g_{FR}\parallel ))$$

and

$$\left|{\text{res}}_j\right|\le \text{ftol}\text{for all}j\text{,}$$

where $Z^T{g}_{FR}$ is the projected gradient (see Overview), $g_{FR}$ is the gradient of $F\left(x\right)$ with respect to the free variables, ${\text{res}}_j$ is the violation of the $j$th active nonlinear constraint, and $\text{ftol}$ is the ‘Nonlinear Feasibility Tolerance’.

‘Start Objective Check At Variable’int

Default $=1$

These keywords take effect only if $\text{‘Verify Level'}>0$. They may be used to control the verification of gradient elements computed by $objfun$ and/or Jacobian elements computed by $confun$. For example, if the first $30$ elements of the objective gradient appeared to be correct in an earlier run, so that only element $31$ remains questionable, it is reasonable to specify $\text{‘Start Objective Check At Variable'}=31$. If the first $30$ variables appear linearly in the objective, so that the corresponding gradient elements are constant, the above choice would also be appropriate.

If $i_{2\text{m}-1}\le 0$ or $i_{2\text{m}-1}>min(n,i_{2\text{m}})$, the default value is used, for $\text{m}=1,2,\dots ,2$. If $i_{2\text{m}}\le 0$ or $i_{2\text{m}}>n$, the default value is used, for $\text{m}=1,2,\dots ,2$.

‘Stop Objective Check At Variable’int

Default $=n$

These keywords take effect only if $\text{‘Verify Level'}>0$. They may be used to control the verification of gradient elements computed by $objfun$ and/or Jacobian elements computed by $confun$. For example, if the first $30$ elements of the objective gradient appeared to be correct in an earlier run, so that only element $31$ remains questionable, it is reasonable to specify $\text{‘Start Objective Check At Variable'}=31$. If the first $30$ variables appear linearly in the objective, so that the corresponding gradient elements are constant, the above choice would also be appropriate.

If $i_{2\text{m}-1}\le 0$ or $i_{2\text{m}-1}>min(n,i_{2\text{m}})$, the default value is used, for $\text{m}=1,2,\dots ,2$. If $i_{2\text{m}}\le 0$ or $i_{2\text{m}}>n$, the default value is used, for $\text{m}=1,2,\dots ,2$.

‘Start Constraint Check At Variable’int

Default $=1$

These keywords take effect only if $\text{‘Verify Level'}>0$. They may be used to control the verification of gradient elements computed by $objfun$ and/or Jacobian elements computed by $confun$. For example, if the first $30$ elements of the objective gradient appeared to be correct in an earlier run, so that only element $31$ remains questionable, it is reasonable to specify $\text{‘Start Objective Check At Variable'}=31$. If the first $30$ variables appear linearly in the objective, so that the corresponding gradient elements are constant, the above choice would also be appropriate.

If $i_{2\text{m}-1}\le 0$ or $i_{2\text{m}-1}>min(n,i_{2\text{m}})$, the default value is used, for $\text{m}=1,2,\dots ,2$. If $i_{2\text{m}}\le 0$ or $i_{2\text{m}}>n$, the default value is used, for $\text{m}=1,2,\dots ,2$.

‘Stop Constraint Check At Variable’int

Default $=n$

These keywords take effect only if $\text{‘Verify Level'}>0$. They may be used to control the verification of gradient elements computed by $objfun$ and/or Jacobian elements computed by $confun$. For example, if the first $30$ elements of the objective gradient appeared to be correct in an earlier run, so that only element $31$ remains questionable, it is reasonable to specify $\text{‘Start Objective Check At Variable'}=31$. If the first $30$ variables appear linearly in the objective, so that the corresponding gradient elements are constant, the above choice would also be appropriate.

If $i_{2\text{m}-1}\le 0$ or $i_{2\text{m}-1}>min(n,i_{2\text{m}})$, the default value is used, for $\text{m}=1,2,\dots ,2$. If $i_{2\text{m}}\le 0$ or $i_{2\text{m}}>n$, the default value is used, for $\text{m}=1,2,\dots ,2$.

‘Step Limit’float

Default $=2.0$

If $r>0,r$ specifies the maximum change in variables at the first step of the linesearch. 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 elements of $x$ can lead to floating-point overflow. The argument $r$ is, therefore, used to encourage evaluation of the problem functions at meaningful points. Given any major iterate $x$, the first point $\tilde{x}$ at which $F$ and $c$ are evaluated during the linesearch is restricted so that

$${\parallel \tilde{x}-x\parallel }_2\le r(1+{\parallel x\parallel }_2)\text{.}$$

The linesearch may go on and evaluate $F$ and $c$ at points further from $x$ if this will result in a lower value of the merit function (indicated by L at the end of each line of output produced by the major iterations; see Further Comments). If L is printed for most of the iterations, $r$ should be set to a larger value.

Wherever possible, upper and lower bounds on $x$ should be used to prevent evaluation of nonlinear functions at wild values. The default value $\text{‘Step Limit'}=2.0$ should not affect progress on well-behaved functions, but values such as $0.1$ or $0.01$ may be helpful when rapidly varying functions are present. If a small value of ‘Step Limit’ is selected, a good starting point may be required. An important application is to the class of nonlinear least squares problems. If $r\le 0$, the default value is used.

‘Verify Level’int

Default $=0$

These keywords refer to finite difference checks on the gradient elements computed by $objfun$ and $confun$. The possible choices for $i$ are as follows:

$i$	Meaning
$-1$	No checks are performed.
$0$	Only a ‘cheap’ test will be performed.
$\ge 1$	Individual gradient elements will also be checked using a reliable (but more expensive) test.

It is possible to specify $\text{‘Verify Level'}=0$ to $3$ in several ways. For example, the nonlinear objective gradient (if any) will be verified if either ‘Verify Objective Gradients’ or $\text{‘Verify Level'}=1$ is specified. The constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=2$ or ‘Verify’ is specified. Similarly, the objective and the constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=3$ or ‘Verify’ is specified.

If $0\le i\le 3$, gradients will be verified at the first point that satisfies the linear constraints and bounds.

If $i=0$, only a ‘cheap’ test will be performed, requiring one call to $objfun$ and (if appropriate) one call to $confun$.

If $1\le i\le 3$, a more reliable (but more expensive) check will be made on individual gradient elements, within the ranges specified by the ‘Start Constraint Check At Variable’ and ‘Stop Constraint Check At Variable’ keywords. A result of the form OK or BAD? is printed by nlp_multistart_sqp to indicate whether or not each element appears to be correct. If a gradient element is determined to be extremely poor (i.e., if it appears to have no significant digits of accuracy at all) then nlp_multistart_sqp will also exit with an error indicator in argument $\text{errno}$.

If $10\le i\le 13$, the action is the same as for $i-10$, except that it will take place at the user-specified initial value of $x$.

If $i<-1$ or $4\le i\le 9$ or $i>13$, the default value is used.

We suggest that $\text{‘Verify Level'}=3$ be used whenever a new function function is being developed.

‘Verify’valueless

These keywords refer to finite difference checks on the gradient elements computed by $objfun$ and $confun$. The possible choices for $i$ are as follows:

$i$	Meaning
$-1$	No checks are performed.
$0$	Only a ‘cheap’ test will be performed.
$\ge 1$	Individual gradient elements will also be checked using a reliable (but more expensive) test.

It is possible to specify $\text{‘Verify Level'}=0$ to $3$ in several ways. For example, the nonlinear objective gradient (if any) will be verified if either ‘Verify Objective Gradients’ or $\text{‘Verify Level'}=1$ is specified. The constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=2$ or ‘Verify’ is specified. Similarly, the objective and the constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=3$ or ‘Verify’ is specified.

If $0\le i\le 3$, gradients will be verified at the first point that satisfies the linear constraints and bounds.

If $i=0$, only a ‘cheap’ test will be performed, requiring one call to $objfun$ and (if appropriate) one call to $confun$.

If $1\le i\le 3$, a more reliable (but more expensive) check will be made on individual gradient elements, within the ranges specified by the ‘Start Constraint Check At Variable’ and ‘Stop Constraint Check At Variable’ keywords. A result of the form OK or BAD? is printed by nlp_multistart_sqp to indicate whether or not each element appears to be correct. If a gradient element is determined to be extremely poor (i.e., if it appears to have no significant digits of accuracy at all) then nlp_multistart_sqp will also exit with an error indicator in argument $\text{errno}$.

If $10\le i\le 13$, the action is the same as for $i-10$, except that it will take place at the user-specified initial value of $x$.

If $i<-1$ or $4\le i\le 9$ or $i>13$, the default value is used.

We suggest that $\text{‘Verify Level'}=3$ be used whenever a new function function is being developed.

‘Verify Constraint Gradients’valueless

These keywords refer to finite difference checks on the gradient elements computed by $objfun$ and $confun$. The possible choices for $i$ are as follows:

$i$	Meaning
$-1$	No checks are performed.
$0$	Only a ‘cheap’ test will be performed.
$\ge 1$	Individual gradient elements will also be checked using a reliable (but more expensive) test.

It is possible to specify $\text{‘Verify Level'}=0$ to $3$ in several ways. For example, the nonlinear objective gradient (if any) will be verified if either ‘Verify Objective Gradients’ or $\text{‘Verify Level'}=1$ is specified. The constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=2$ or ‘Verify’ is specified. Similarly, the objective and the constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=3$ or ‘Verify’ is specified.

If $0\le i\le 3$, gradients will be verified at the first point that satisfies the linear constraints and bounds.

If $i=0$, only a ‘cheap’ test will be performed, requiring one call to $objfun$ and (if appropriate) one call to $confun$.

If $1\le i\le 3$, a more reliable (but more expensive) check will be made on individual gradient elements, within the ranges specified by the ‘Start Constraint Check At Variable’ and ‘Stop Constraint Check At Variable’ keywords. A result of the form OK or BAD? is printed by nlp_multistart_sqp to indicate whether or not each element appears to be correct. If a gradient element is determined to be extremely poor (i.e., if it appears to have no significant digits of accuracy at all) then nlp_multistart_sqp will also exit with an error indicator in argument $\text{errno}$.

If $10\le i\le 13$, the action is the same as for $i-10$, except that it will take place at the user-specified initial value of $x$.

If $i<-1$ or $4\le i\le 9$ or $i>13$, the default value is used.

We suggest that $\text{‘Verify Level'}=3$ be used whenever a new function function is being developed.

‘Verify Gradients’valueless

These keywords refer to finite difference checks on the gradient elements computed by $objfun$ and $confun$. The possible choices for $i$ are as follows:

$i$	Meaning
$-1$	No checks are performed.
$0$	Only a ‘cheap’ test will be performed.
$\ge 1$	Individual gradient elements will also be checked using a reliable (but more expensive) test.

It is possible to specify $\text{‘Verify Level'}=0$ to $3$ in several ways. For example, the nonlinear objective gradient (if any) will be verified if either ‘Verify Objective Gradients’ or $\text{‘Verify Level'}=1$ is specified. The constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=2$ or ‘Verify’ is specified. Similarly, the objective and the constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=3$ or ‘Verify’ is specified.

If $0\le i\le 3$, gradients will be verified at the first point that satisfies the linear constraints and bounds.

If $i=0$, only a ‘cheap’ test will be performed, requiring one call to $objfun$ and (if appropriate) one call to $confun$.

If $1\le i\le 3$, a more reliable (but more expensive) check will be made on individual gradient elements, within the ranges specified by the ‘Start Constraint Check At Variable’ and ‘Stop Constraint Check At Variable’ keywords. A result of the form OK or BAD? is printed by nlp_multistart_sqp to indicate whether or not each element appears to be correct. If a gradient element is determined to be extremely poor (i.e., if it appears to have no significant digits of accuracy at all) then nlp_multistart_sqp will also exit with an error indicator in argument $\text{errno}$.

If $10\le i\le 13$, the action is the same as for $i-10$, except that it will take place at the user-specified initial value of $x$.

If $i<-1$ or $4\le i\le 9$ or $i>13$, the default value is used.

We suggest that $\text{‘Verify Level'}=3$ be used whenever a new function function is being developed.

‘Verify Objective Gradients’valueless

These keywords refer to finite difference checks on the gradient elements computed by $objfun$ and $confun$. The possible choices for $i$ are as follows:

$i$	Meaning
$-1$	No checks are performed.
$0$	Only a ‘cheap’ test will be performed.
$\ge 1$	Individual gradient elements will also be checked using a reliable (but more expensive) test.

It is possible to specify $\text{‘Verify Level'}=0$ to $3$ in several ways. For example, the nonlinear objective gradient (if any) will be verified if either ‘Verify Objective Gradients’ or $\text{‘Verify Level'}=1$ is specified. The constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=2$ or ‘Verify’ is specified. Similarly, the objective and the constraint gradients will be verified if $\text{‘Verify'}=\text{'YES'}$ or $\text{‘Verify Level'}=3$ or ‘Verify’ is specified.

If $0\le i\le 3$, gradients will be verified at the first point that satisfies the linear constraints and bounds.

If $i=0$, only a ‘cheap’ test will be performed, requiring one call to $objfun$ and (if appropriate) one call to $confun$.

If $1\le i\le 3$, a more reliable (but more expensive) check will be made on individual gradient elements, within the ranges specified by the ‘Start Constraint Check At Variable’ and ‘Stop Constraint Check At Variable’ keywords. A result of the form OK or BAD? is printed by nlp_multistart_sqp to indicate whether or not each element appears to be correct. If a gradient element is determined to be extremely poor (i.e., if it appears to have no significant digits of accuracy at all) then nlp_multistart_sqp will also exit with an error indicator in argument $\text{errno}$.

If $10\le i\le 13$, the action is the same as for $i-10$, except that it will take place at the user-specified initial value of $x$.

If $i<-1$ or $4\le i\le 9$ or $i>13$, the default value is used.

We suggest that $\text{‘Verify Level'}=3$ be used whenever a new function function is being developed.

Raises

NagValueError

(errno $1$)

On entry, $nb=⟨value⟩$ and $npts=⟨value⟩$.

Constraint: $1\le nb\le npts$.

(errno $1$)

On entry, $bl[i-1]>bu[i-1]$: $i=⟨value⟩$.

Constraint: $bl[i-1]\le bu[i-1]$, for all $i$.

(errno $1$)

On entry, $ncnln=⟨value⟩$.

Constraint: $ncnln\ge 0$.

(errno $1$)

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

Constraint: $\text{nclin}\ge 0$.

(errno $1$)

On entry, $n=⟨value⟩$.

Constraint: $n>0$.

(errno $1$)

On entry, $\text{ldclda}=⟨value⟩$, $n=⟨value⟩$, $\text{nclin}=⟨value⟩$ and $ncnln=⟨value⟩$.

Constraint: $\text{ldclda}\ge n+\text{nclin}+ncnln$.

(errno $1$)

On entry, $ncnln>0$, $\text{sdcjac}=⟨value⟩$ and $n=⟨value⟩$.

Constraint: if $ncnln>0$, $\text{sdcjac}\ge n$.

(errno $1$)

On entry, $\text{listat}=⟨value⟩$, $n=⟨value⟩$, $\text{nclin}=⟨value⟩$ and $ncnln=⟨value⟩$.

Constraint: $\text{listat}\ge n+\text{nclin}+ncnln$.

(errno $2$)

No solution obtained. Linear constraints may be infeasible.

(errno $3$)

No solution obtained. Nonlinear constraints may be infeasible.

(errno $4$)

No solution obtained. Many potential solutions reach iteration limit.

(errno $7$)

User-supplied derivatives probably wrong.

(errno $10$)

Failed to initialize option arrays.

Warns

NagAlgorithmicWarning

(errno $8$)

Only $⟨value⟩$ solutions obtained.

NagCallbackTerminateWarning

(errno $9$)

User terminated computation from $start$ procedure: $mode=⟨value⟩$.

Notes

The problem is assumed to be stated in the following form:

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

where $F\left(x\right)$ (the objective function) is a nonlinear function, $A_L$ is an $n_L\times n$ linear constraint matrix, and $c\left(x\right)$ is an $n_N$ element vector of nonlinear constraint functions. (The matrix $A_L$ and the vector $c\left(x\right)$ may be empty.) The objective function and the constraint functions are assumed to be smooth, i.e., at least twice-continuously differentiable. (This function will usually solve (1) if there are only isolated discontinuities away from the solution.)

nlp_multistart_sqp solves a user-specified number of local optimization problems with different starting points. You may specify the starting points via the function $start$. If a random number generator is used to generate the starting points then the argument $repeat$ allows you to specify whether a repeatable set of points are generated or whether different starting points are generated on different calls. The resulting local minima are ordered and the best $nb$ results returned in order of ascending values of the resulting objective function values at the minima. Thus the value returned in position $1$ will be the best result obtained. If a sufficient number of different points are chosen then this is likely to be be the global minimum. Please note that the default version of $start$ uses a random number generator to generate the starting points.

References

Dennis, J E Jr and Moré, J J, 1977, Quasi-Newton methods, motivation and theory, SIAM Rev. (19), 46–89

Dennis, J E Jr and Schnabel, R B, 1981, A new derivation of symmetric positive-definite secant updates, nonlinear programming, (eds O L Mangasarian, R R Meyer and S M Robinson) (4), 167–199, Academic Press

Dennis, J E Jr and Schnabel, R B, 1983, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice–Hall

Fletcher, R, 1987, Practical Methods of Optimization, (2nd Edition), Wiley

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, Murray, W, Saunders, M A and Wright, M H, 1984, Users’ guide for SOL/QPSOL version 3.2, Report SOL, 84–5, Department of Operations Research, Stanford University

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, 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 and Wright, M H, 1981, Practical Optimization, Academic Press

Powell, M J D, 1974, Introduction to constrained optimization, Numerical Methods for Constrained Optimization, (eds P E Gill and W Murray), 1–28, Academic Press

Powell, M J D, 1983, Variable metric methods in constrained optimization, Mathematical Programming: the State of the Art, (eds A Bachem, M Grötschel and B Korte), 288–311, Springer–Verlag