e04rsc is a part of the NAG optimization modelling suite and defines a new, or edits an existing, quadratic objective function or constraint of the problem.

2 Specification

#include <nag.h>

void	e04rsc (void handle, double s, Integer nnzr, const Integer idxr[], const double r[], Integer nnzq, const Integer irowq[], const Integer icolq[], const double q[], Integer idqc, NagError *fail)

The function may be called by the names: e04rsc or nag_opt_handle_set_qconstr.

3 Description

After the handle has been initialized (e.g., e04rac has been called), e04rsc may be used to edit a model by adding or replacing a quadratic objective function or constraint of the form

\frac{1}{2} x^{T} Q x + r^{T} x

(1)

and

\frac{1}{2} x^{T} Q x + r^{T} x + s \leq 0,

(2)

respectively. If a factor

F

Q

such that

Q = F^{T} F

is available, e04rtc should be called instead.

The matrix

Q

is a sparse symmetric

n \times n

matrix. Typically e04rsc would be used together with Second-order Cone Programming (SOCP) solver e04ptc if

Q

is positive semidefinite which implies the problem is convex. Otherwise, if the problem is nonconvex, a general nonlinear optimization solver (such as e04stc) may be used. It is also acceptable if

Q

is a zero matrix, in which case the corresponding objective function or constraint becomes linear. Note that it is possible to temporarily disable and enable individual constraints in the model by e04tcc and e04tbc, respectively. See Section 4.1 in the E04 Chapter Introduction for more details about the NAG optimization modelling suite.

4 References

None.

5 Arguments

1: $handle$ – void * Input

On entry: the handle to the problem. It needs to be initialized (e.g., by e04rac) and must not be changed between calls to the NAG optimization modelling suite.

2: $s$ – double Input

On entry: the constant term in quadratic constraint.

idqc = −1

, s will not be referenced.

3: $nnzr$ – Integer Input

On entry: the number of nonzero elements in the sparse vector

r

nnzr = 0

r

is considered to be zero and the arrays idxr and r will not be referenced and may be NULL.

Constraint:

nnzr \geq 0

4: $idxr [nnzr]$ – const Integer Input

5: $r [nnzr]$ – const double Input

On entry: the nonzero elements of the sparse vector

r

idxr [i - 1]

must contain the index of

r [i - 1]

in the vector, for

i = 1, 2, \dots, nnzr

. No particular order is expected, but elements should not repeat. Note that

n

is the current number of variables in the problem.

Constraint:

1 \leq idxr [i - 1] \leq n

, for

i = 1, 2, \dots, nnzr

6: $nnzq$ – Integer Input

On entry: the number of nonzero elements in the upper triangle of the matrix

Q

nnzq = 0

, the matrix

Q

is considered to be zero, the objective function or constraint is linear and irowq, icolq and q will not be referenced and may be NULL.

Constraint:

nnzq \geq 0

7: $irowq [nnzq]$ – const Integer Input

8: $icolq [nnzq]$ – const Integer Input

9: $q [nnzq]$ – const double Input

On entry: arrays irowq, icolq and q store the nonzeros of the upper triangle of the matrix

Q

in coordinate storage (CS) format (see Section 2.1.1 in the F11 Chapter Introduction). irowq specifies one-based row indices, icolq specifies one-based column indices and q specifies the values of the nonzero elements in such a way that

Q_{i j} = q [l - 1]

where

i = irowq [l - 1]

j = icolq [l - 1]

, for

l = 1, 2, \dots, nnzq

. No particular order is expected, but elements should not repeat.

Constraint:

1 \leq irowq [l - 1] \leq icolq [l - 1] \leq n

, for

l = 1, 2, \dots, nnzq

10: $idqc$ – Integer * Input/Output

On entry:

$idqc = 0$: A new quadratic constraint is created.
$idqc > 0$: Specifies the index of an existing constraint to be replaced. i.e., replaces the idqcth constraint.
$idqc = −1$: A new quadratic objective is created and will replace any previously defined objective function.

Constraint:

idqc \geq −1

On exit: if

idqc = 0

on entry, then idqc is overwritten with the index of the new quadratic constraint. By definition, this is the number of quadratic constraints already defined plus one. Otherwise, idqc stays unchanged.

11: $fail$ – NagError * Input/Output

The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $⟨ value ⟩$ had an illegal value.
NE_HANDLE: The supplied handle does not define a valid handle to the data structure for the NAG optimization modelling suite. It has not been properly initialized or it has been corrupted.
NE_INT: nnzr and nnzq cannot be zero at the same time.

On entry, $idqc = ⟨ value ⟩$ .
Constraint: $idqc \geq −1$ .

On entry, $nnzq = ⟨ value ⟩$ .
Constraint: $nnzq \geq 0$ .

On entry, $nnzr = ⟨ value ⟩$ .
Constraint: $nnzr \geq 0$ .
NE_INTARR: On entry, $i = ⟨ value ⟩$ , $idxr [i - 1] = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $1 \leq idxr [i - 1] \leq n$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_INVALID_CS: On entry, $i = ⟨ value ⟩$ , $icolq [i - 1] = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $1 \leq icolq [i - 1] \leq n$ .

On entry, $i = ⟨ value ⟩$ , $irowq [i - 1] = ⟨ value ⟩$ and $icolq [i - 1] = ⟨ value ⟩$ .
Constraint: $irowq [i - 1] \leq icolq [i - 1]$ (elements within the upper triangle).

On entry, $i = ⟨ value ⟩$ , $irowq [i - 1] = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $1 \leq irowq [i - 1] \leq n$ .

On entry, more than one element of q has row index $⟨ value ⟩$ and column index $⟨ value ⟩$ .
Constraint: each element of q must have a unique row and column index.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_NOT_INCREASING: On entry, more than one element of idxr has index $⟨ value ⟩$ .
Constraint: each element of idxr must have a unique index.
NE_PHASE: The problem cannot be modified right now, the solver is running.
NE_REF_MATCH: On entry, $idqc = ⟨ value ⟩$ .
The given idqc does not match with any quadratic constraint already defined.

7 Accuracy

Not applicable.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

e04rsc is not threaded in any implementation.

9 Further Comments

None.

10 Example

This example demonstrates how to define and solve a convex quadratically constrained quadratic programming problem via SOCP. See also e04rtc where the quadratic term is defined by its factor.

This example solves a quadratically constrained quadratic programming problem

\begin{array}{l} \underset{x \in ℝ^{3}}{minimize} & \frac{1}{2} x^{T} Q_{0} x + r_{0}^{T} x \\ subject to & \frac{1}{2} x^{T} Q_{1} x + r_{1}^{T} x + s_{1} \leq 0, \end{array}

where

\begin{matrix} Q_{0} = (\begin{matrix} 0.493 & 0.382 & 0.270 \\ 0.382 & 0.475 & 0.448 \\ 0.270 & 0.448 & 0.515 \end{matrix}) & Q_{1} = (\begin{matrix} 0.737 & 0.453 & 1.002 \\ 0.453 & 0.316 & 0.635 \\ 1.002 & 0.635 & 1.590 \end{matrix}), \\ r_{0} = (\begin{matrix} 0.847 \\ 0.08 \\ 0.505 \end{matrix}) & r_{1} = (\begin{matrix} 0.065 \\ 0.428 \\ 0.097 \end{matrix}) \end{matrix}

and

s_{1} = 1.276

The optimal solution (to five significant figures) is

x^{*} = {(1.1742, - 4.2569, 0.98144)}^{T},

and the objective function value is

2.5714

e04rs: FL CL CPP AD PY MB

NAG CL Interfacee04rsc (handle_​set_​qconstr)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG CL Interface
e04rsc (handle_set_qconstr)