E04 Chapter Contents
E04 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentE04RHF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

E04RHF is a part of the NAG optimization modelling suite and defines bounds on the variables of the problem.

## 2  Specification

 SUBROUTINE E04RHF ( HANDLE, NVAR, BL, BU, IFAIL)
 INTEGER NVAR, IFAIL REAL (KIND=nag_wp) BL(NVAR), BU(NVAR) TYPE (C_PTR) HANDLE

## 3  Description

After the initialization routine E04RAF has been called, E04RHF may be used to define the variable bounds ${l}_{x}\le x\le {u}_{x}$ of the problem unless the bounds have already been defined. This will typically be used for problems, such as quadratic programming (QP)
 $minimize x∈ℝn 12 xTHx + cTx (a) subject to lB≤Bx≤uB (b) lx≤x≤ux (c)$ (1)
nonlinear programming (NLP)
 $minimize x∈ℝn fx (a) subject to lg≤gx≤ug (b) lB≤Bx≤uB (c) lx≤x≤ux (d)$ (2)
linear semidefinite programming (SDP)
 $minimize x∈ℝn cTx (a) subject to ∑ i=1 n xi Aik - A0k ⪰ 0 , k=1,…,mA (b) lB≤Bx≤uB (c) lx≤x≤ux (d)$ (3)
or semidefinite programming with bilinear matrix inequalities (BMI-SDP)
 $minimize x∈ℝn 12 xTHx + cTx (a) subject to ∑ i,j=1 n xi xj Qijk + ∑ i=1 n xi Aik - A0k ⪰ 0 , k=1,…,mA (b) lB≤Bx≤uB (c) lx≤x≤ux (d)$ (4)
where ${l}_{x}$ and ${u}_{x}$ are $n$-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. If certain bounds are not present, the associated elements of ${l}_{x}$ or ${u}_{x}$ may be set to special values that are treated as $-\infty$ or $+\infty$. See the description of the optional parameter Infinite Bound Size of the solvers in the suite, E04STF and E04SVF. Its value is denoted as $\mathit{bigbnd}$ further in this text. Note that the bounds are interpreted based on its value at the time of calling this routine and any later alterations to Infinite Bound Size will not affect these constraints.
See E04RAF for more details.

## 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:     $\mathrm{HANDLE}$ – TYPE (C_PTR)Input
On entry: the handle to the problem. It needs to be initialized by E04RAF and must not be changed.
2:     $\mathrm{NVAR}$ – INTEGERInput
On entry: $n$, the number of decision variables $x$ in the problem. It must be unchanged from the value set during the initialization of the handle by E04RAF.
3:     $\mathrm{BL}\left({\mathbf{NVAR}}\right)$ – REAL (KIND=nag_wp) arrayInput
4:     $\mathrm{BU}\left({\mathbf{NVAR}}\right)$ – REAL (KIND=nag_wp) arrayInput
On entry: ${l}_{x}$, BL and ${u}_{x}$, BU define lower and upper bounds on the variables, respectively. To specify a nonexistent lower bound (i.e., ${l}_{j}=-\infty$), set ${\mathbf{BL}}\left(j\right)\le -\mathit{bigbnd}$; to specify a nonexistent upper bound (i.e., ${u}_{j}=\infty$), set ${\mathbf{BU}}\left(j\right)\ge \mathit{bigbnd}$. Fixing of the variables is not allowed in this release, however, this limitation will be removed in a future release.
Constraints:
• ${\mathbf{BL}}\left(\mathit{j}\right)<{\mathbf{BU}}\left(\mathit{j}\right)$, for $\mathit{j}=1,2,\dots ,{\mathbf{NVAR}}$;
• ${\mathbf{BL}}\left(\mathit{j}\right)<\mathit{bigbnd}$, for $\mathit{j}=1,2,\dots ,{\mathbf{NVAR}}$;
• ${\mathbf{BU}}\left(\mathit{j}\right)>-\mathit{bigbnd}$, for $\mathit{j}=1,2,\dots ,{\mathbf{NVAR}}$.
5:     $\mathrm{IFAIL}$ – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, the recommended value is $-1$. When the value $-\mathbf{1}\text{​ or ​}1$ is used it is essential to test the value of IFAIL on exit.
On exit: ${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}=0$ or $-1$, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
${\mathbf{IFAIL}}=1$
The supplied HANDLE does not define a valid handle to the data structure for the NAG optimization modelling suite. It has not been initialized by E04RAF or it has been corrupted.
${\mathbf{IFAIL}}=2$
The problem cannot be modified in this phase any more, the solver has already been called.
${\mathbf{IFAIL}}=3$
Variable bounds have already been defined.
${\mathbf{IFAIL}}=4$
On entry, ${\mathbf{NVAR}}=〈\mathit{\text{value}}〉$, expected $\mathrm{value}=〈\mathit{\text{value}}〉$.
Constraint: NVAR must match the value given during initialization of HANDLE.
${\mathbf{IFAIL}}=10$
On entry, $j=〈\mathit{\text{value}}〉$, ${\mathbf{BL}}\left(j\right)=〈\mathit{\text{value}}〉$, $\mathit{bigbnd}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{BL}}\left(j\right)<\mathit{bigbnd}$.
On entry, $j=〈\mathit{\text{value}}〉$, ${\mathbf{BL}}\left(j\right)=〈\mathit{\text{value}}〉$ and ${\mathbf{BU}}\left(j\right)=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{BL}}\left(j\right)<{\mathbf{BU}}\left(j\right)$.
On entry, $j=〈\mathit{\text{value}}〉$, ${\mathbf{BU}}\left(j\right)=〈\mathit{\text{value}}〉$, $\mathit{bigbnd}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{BU}}\left(j\right)>-\mathit{bigbnd}$.
${\mathbf{IFAIL}}=-99$
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.
${\mathbf{IFAIL}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.
${\mathbf{IFAIL}}=-999$
Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

Not applicable.

## 8  Parallelism and Performance

E04RHF is not threaded in any implementation.

None.

## 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 E04SVF.
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 ${\ell }_{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 $\stackrel{^}{Y}$ denote the partially filled in $m×k$ matrix with the valid responses on $\left(i,j\right)\in \Omega$ positions. We are looking for $Y$ of the same size so that the valid responses are unchanged and the nuclear norm (denoted here as ${‖·‖}_{*}$) is minimal.
 $minimizeY Y* subject to Yij = Y^ij for all i,j∈Ω.$
This is equivalent to
 $minimize W1, W2, Y trace W1+ trace W2 subject to Yij = Y^ij for all i,j∈Ω W1 Y YT W2 ⪰ 0$
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
 $Y^ = * * * * * 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 * *$
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 = 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 .$
The example also turns on monitor mode of E04SVF, 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 routine is stopped by setting ${\mathbf{INFORM}}=0$ within the monitor step.

### 10.1  Program Text

Program Text (e04rhfe.f90)

### 10.2  Program Data

Program Data (e04rhfe.d)

### 10.3  Program Results

Program Results (e04rhfe.r)