-dimensional vectors. Note that upper and lower bounds are specified for all the variables. This form allows full generality in specifying various types of constraint. In particular, the

j

th variable may be fixed by setting

l_{j} = u_{j}

. If certain bounds are not present, the associated elements of

l_{x}

u_{x}

may be set to special values that are treated as

- \infty

+ \infty

. See the description of the optional parameter

Infinite Bound Size

which is common among all solvers in the suite. Its value is denoted as

bigbnd

further in this text. Note that the bounds are interpreted based on its value at the time of calling this function and any later alterations to

Infinite Bound Size

will not affect these constraints.

See Section 4.1 in the E04 Chapter Introduction for more details about the NAG optimization modelling suite.

4 References

Candes E and Recht B (2009) Exact matrix completion via convex optimization Foundations of Computation Mathematics (Volume 9) 717–772

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: $nvar$ – Integer Input

On entry:

n

, the current number of decision variables

x

in the model.

3: $bl [nvar]$ – const double Input

4: $bu [nvar]$ – const double Input

On entry:

l_{x}

, bl and

u_{x}

, bu define lower and upper bounds on the variables, respectively. To fix the

j

th variable, set

bl [j - 1] = bu [j - 1] = β

, where

| β | < bigbnd

. To specify a nonexistent lower bound (i.e.,

l_{j} = - \infty

), set

bl [j - 1] \leq - bigbnd

; to specify a nonexistent upper bound (i.e.,

u_{j} = \infty

), set

bu [j - 1] \geq bigbnd

Constraints:

$bl [j - 1] \leq bu [j - 1]$ , for $j = 1, 2, \dots, nvar$ ;
$bl [j - 1] < bigbnd$ , for $j = 1, 2, \dots, nvar$ ;
$bu [j - 1] > - bigbnd$ , for $j = 1, 2, \dots, nvar$ .

5: $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_BOUND: On entry, $j = ⟨ value ⟩$ , $bl [j - 1] = ⟨ value ⟩$ , $bigbnd = ⟨ value ⟩$ .
Constraint: $bl [j - 1] < bigbnd$ .

On entry, $j = ⟨ value ⟩$ , $bl [j - 1] = ⟨ value ⟩$ and $bu [j - 1] = ⟨ value ⟩$ .
Constraint: $bl [j - 1] \leq bu [j - 1]$ .

On entry, $j = ⟨ value ⟩$ , $bu [j - 1] = ⟨ value ⟩$ , $bigbnd = ⟨ value ⟩$ .
Constraint: $bu [j - 1] > - bigbnd$ .
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_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_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_PHASE: The problem cannot be modified right now, the solver is running.
NE_REF_MATCH: On entry, $nvar = ⟨ value ⟩$ , expected $value = ⟨ value ⟩$ .
Constraint: nvar must match the current number of variables of the model in the handle.

7 Accuracy

Not applicable.

8 Parallelism and Performance

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

e04rhc is not threaded in any implementation.

9 Further Comments

9.1 Internal Changes

Internal changes have been made to this function as follows:

At Mark 26.1: The limitation to specifying model fixed variables ( $bl [j - 1] = bu [j - 1]$ for some $j$ ) where such input returns $fail . code =$ NE_BOUND was lifted.
At Mark 27.1: Previously, it was not possible to modify the bounds once they were set or to edit the model once a solver had been called. These limitations were removed and the associated error codes were removed.

For details of all known issues which have been reported for the NAG Library please refer to the Known Issues.

10 Example

There is a vast number of problems which can be reformulated as SDP. This example follows Candes and Recht (2009) to show how a rank minimization problem can be approximated by SDP. In addition, it demonstrates how to work with the monitor mode of e04svc.

The problem can be stated as follows: Let's have

m

respondents answering

k

questions where they express their preferences as a number between

0

and

1

or the question can be left unanswered. The task is to fill in the missing entries, i.e., to guess the unexpressed preferences. This problem falls into the category of matrix completion. The idea is to choose the missing entries to minimize the rank of the matrix as it is commonly believed that only a few factors contribute to an individual's tastes or preferences.

Rank minimization is in general NP-hard but it can be approximated by a heuristic, minimizing the nuclear norm of the matrix. The nuclear norm of a matrix is the sum of its singular values. A rank deficient matrix must have (several) zero singular values. Given the fact that the singular values are always non-negative, a minimization of the nuclear norm has the same effect as

ℓ_{1}

norm in compress sensing, i.e., it encourages many singular values to be zero and thus it can be considered as a heuristic for the original rank minimization problem.

Let

\hat{Y}

denote the partially filled in

m \times k

matrix with the valid responses on

(i, j) \in Ω

positions. We are looking for

Y

of the same size so that the valid responses are unchanged and the nuclear norm (denoted here as

{‖ \cdot ‖}_{*}

) is minimal.

\begin{matrix} \underset{Y}{minimize} & {‖ Y ‖}_{*} \\ subject to & Y_{i j} = {\hat{Y}}_{i j} for all (i, j) \in Ω . \end{matrix}

This is equivalent to

\begin{matrix} \underset{W_{1}, W_{2}, Y}{minimize} & trace (W_{1}) + trace (W_{2}) \\ subject to & Y_{i j} = {\hat{Y}}_{i j} for all (i, j) \in Ω, \\ (\begin{matrix} W_{1} & Y \\ Y^{T} & W_{2} \end{matrix}) ⪰ 0 \end{matrix}

which is the linear semidefinite problem solved in this example, see Candes and Recht (2009) and the references therein for details.

This example has

m = 15

respondents and

k = 6

answers. The obtained answers are

\hat{Y} = (\begin{matrix} * & * & * & * & * & 0.4 \\ 0.6 & 0.4 & 0.8 & * & * & * \\ * & * & 0.8 & * & 0.2 & * \\ 0.8 & 0.2 & * & * & * & * \\ * & 0.4 & * & 0.0 & * & 0.2 \\ 0.4 & * & * & 0.2 & * & 0.2 \\ * & 0.8 & 0.2 & 0.6 & * & * \\ * & * & 0.2 & * & * & * \\ * & 0.4 & * & 0.6 & 0.0 & * \\ * & * & 0.4 & * & * & * \\ * & * & 0.2 & 0.2 & 0.4 & 0.4 \\ * & * & * & * & 1.0 & 0.8 \\ 1.0 & * & 0.2 & * & * & 0.6 \\ * & * & * & * & * & 0.2 \\ 0.6 & * & 0.2 & 0.4 & * & * \end{matrix})

where

*

denotes missing entries (

- 1.0

is used instead in the data file). The obtained matrix has rank

4

and it is shown below printed to

1

-digit accuracy:

Y = (\begin{matrix} 0.5 & 0.3 & 0.2 & 0.2 & 0.4 & 0.4 \\ 0.6 & 0.4 & 0.8 & 0.2 & 0.3 & 0.4 \\ 0.4 & 0.3 & 0.8 & 0.0 & 0.2 & 0.2 \\ 0.8 & 0.2 & 0.3 & 0.4 & 0.3 & 0.4 \\ 0.0 & 0.4 & 0.2 & 0.0 & 0.2 & 0.2 \\ 0.4 & 0.1 & 0.2 & 0.2 & 0.1 & 0.2 \\ 0.6 & 0.8 & 0.2 & 0.6 & 0.2 & 0.4 \\ 0.1 & 0.1 & 0.2 & 0.0 & 0.0 & 0.1 \\ 0.6 & 0.4 & 0.1 & 0.6 & 0.0 & 0.3 \\ 0.2 & 0.1 & 0.4 & 0.0 & 0.1 & 0.1 \\ 0.5 & 0.3 & 0.2 & 0.2 & 0.4 & 0.4 \\ 0.7 & 0.4 & 0.3 & 0.0 & 1.0 & 0.8 \\ 1.0 & 0.3 & 0.2 & 0.5 & 0.5 & 0.6 \\ 0.2 & 0.1 & 0.1 & 0.1 & 0.2 & 0.2 \\ 0.6 & 0.3 & 0.2 & 0.4 & 0.2 & 0.3 \end{matrix}) .

The example also turns on monitor mode of e04svc, there is a time limit introduced for the solver which is being checked at the end of every outer iteration. If the time limit is reached, the function is stopped by setting

inform = 0

within the monitor step.

See also e04rac for links to further examples in the suite.

e04rh: FL CL CPP AD PY MB

NAG CL Interfacee04rhc (handle_​set_​simplebounds)

▸▿ 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

9.1 Internal Changes

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG CL Interface
e04rhc (handle_set_simplebounds)