void	g02akc (double g[], Integer pdg, Integer n, Integer rank, double errtol, double ranktol, Integer maxits, Integer maxit, double x[], Integer pdx, double f, double rankerr, Integer nsub, NagError fail)

The function may be called by the names: g02akc or nag_correg_corrmat_nearest_rank.

3 Description

g02akc finds the nearest correlation matrix

X

of maximum prescribed rank

r

to an approximate correlation matrix

G

in the Frobenius norm.

The solver is based on the Majorized Penalty Approach (MPA) proposed by Gao and Sun (2010). One of the key elements in this type of method is that the subproblems are similar to the nearest correlation matrix problem without rank constraint, and can be solved efficiently by g02aac. The total number of subproblems solved is controlled by the arguments maxit and maxits. The algorithm behaviour and solver accuracy can be modified by these and other input arguments. The default values for these arguments are chosen to work well in the general case but it is recommended that you tune them to your particular problem. For a detailed description of the algorithm see Section 11.

4 References

Bai S, Qi H–D and Xiu N (2015) Constrained best Euclidean distance embedding on a sphere: A matrix optimization approach SIAM J. Optim. 25(1) 439–467

Gao Y and Sun D (2010) A majorized penalty approach for calibrating rank constrained correlation matrix problems Technical report Department of Mathematics, National University of Singapore

Qi H–D and Yuan X (2014) Computing the nearest Euclidean distance matrix with low embedding dimensions Mathematical Programming 147(1–2) 351–389

5 Arguments

1: $g [pdg \times n]$ – double Input/Output: On entry: $\tilde{G}$ , the initial matrix.

On exit: a symmetric matrix $G = \frac{1}{2} (\tilde{G} + {\tilde{G}}^{T})$ with diagonal elements set to $1.0$ .
2: $pdg$ – Integer Input: On entry: the stride separating row elements of the matrix $G$ in the array g.

Constraint: $pdg \geq n$ .
3: $n$ – Integer Input: On entry: the order of the matrix $G$ .

Constraint: $n > 0$ .
4: $rank$ – Integer Input: On entry: $r$ , the upper bound for the rank of $X$ .

Constraint: $0 < rank \leq n$ .
5: $errtol$ – double Input: On entry: the termination tolerance for the convergence measure of the objective function value.
If $errtol \leq 0.0$ , then a value of $1.0e−5$ is used. See Section 11 for further details.
6: $ranktol$ – double Input: On entry: the feasibility tolerance for the rank constraint.
If $ranktol \leq 0.0$ , $\sqrt{machine precision}$ is used. See Section 11 for further details.
7: $maxits$ – Integer Input: On entry: specifies the maximum number of iterations used for the majorization approach to solve penalized problems at each level of penalty parameter.
If $maxits \leq 0$ , then a value of $100$ is used.
8: $maxit$ – Integer Input: On entry: specifies the maximum number of iterations for the penalty method, i.e., the maximum level of penalty parameter.
If $maxit \leq 0$ , then a value of $200$ is used.
9: $x [pdx \times n]$ – double Output: On exit: $X$ , the nearest correlation matrix of rank $r$ .
10: $pdx$ – Integer Input: On entry: the stride separating row elements of the matrix $X$ in the array x.

Constraint: $pdx \geq n$ .
11: $f$ – double * Output: On exit: the difference between $X$ and $G$ given by $\frac{1}{2} {‖ X - G ‖}_{F}^{2}$ .
12: $rankerr$ – double * Output: On exit: the rank error of $X$ , defined as $\sum_{i = r + 1}^{n} (λ_{i})$ , given that $λ_{i}$ denote eigenvalues of $X$ sorted in non-increasing order.
13: $nsub$ – Integer * Output: On exit: the total number of majorized problems that have been solved, i.e., the total number of calls for g02aac.
14: $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_CONVERGENCE: Convergence is limited by machine precision. The objective function value or rank is decreasing very slowly.
The array returned in x may still be of interest.

Majorized penalty approach fails to converge in maxit level of penalty iterations.
NE_INT: On entry, $n = ⟨ value ⟩$ .
Constraint: $n > 0$ .
NE_INT_2: On entry, $pdg = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $pdg \geq n$ .

On entry, $pdx = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $pdx \geq n$ .

On entry, $rank = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $0 < rank \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_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.

7 Accuracy

The returned accuracy is controlled by errtol and ranktol, and is limited by machine precision.

8 Parallelism and Performance

g02akc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

g02akc makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

Arrays are internally allocated by g02akc. The total size of these arrays is

11 \times n + 3 \times n \times n + \max (2 \times n \times n + 6 \times n + 1, 120 + 9 \times n)

real elements and

5 \times n + 3

integer elements.

10 Example

This example finds the nearest correlation matrix with target rank

2

to:

G = (\begin{matrix} 2 & - 1 & 0 & 0 \\ - 1 & 2 & - 1 & 0 \\ 0 & - 1 & 2 & - 1 \\ 0 & 0 & - 1 & 2 \end{matrix})

11 Algorithmic Details

g02akc is aimed at solving the rank constrained nearest correlation matrix problem formulated as follows:

\begin{array}{l} \min_{X \in 𝕊^{n}} & \frac{1}{2} {‖ X - G ‖}^{2} \\ s.t. & X_{i i} = 1, i = 1, \dots, n, \\ X ⪰ 0, \\ rank (X) \leq r, \end{array}

(1)

where

G

is the input approximate correlation matrix,

r

is the upper bound of rank of the output nearest correlation matrix

X

, the expression

X ⪰ 0

stands for a constraint on eigenvalues of

X

in the space of

n \times n

symmetric matrices

𝕊^{n}

, namely, all the eigenvalues should be non-negative, i.e., the matrix should be positive semidefinite,

‖ \cdot ‖

denotes the Frobenius norm. Note that the rank constraint is given as an inequality, which means if the intrinsic rank of the input matrix is already less than or equal to

r

, the solver will calculate a nearest correlation matrix without increasing the rank.

This section contains a short description of the algorithm used in g02akc which is based on the Majorized Penalty Approach (MPA) by Gao and Sun (2010). Further details on accuracy and stopping criterion are also included.

11.1 Penalty approach

Let

λ (X)

be the vector of the eigenvalues of

X

(arranged in the non-increasing order) and

P \in ℝ^{n \times n}

be the corresponding matrix of orthonormal eigenvectors of

X

. The equivalent relationship for a positive semidefinite matrix

X

is as follows.

rank (X) \leq r \Leftrightarrow λ_{r + 1} (X) + \dots + λ_{n} (X) = 0 .

Therefore, problem (1) can be equivalently written as

\begin{array}{l} \min_{X \in 𝕊^{n}} & f (X) ≔ \frac{1}{2} {‖ X - G ‖}^{2} \\ s.t. & X_{i i} = 1, i = 1, \dots n, \\ X ⪰ 0, \\ λ_{r + 1} (X) + \dots + λ_{n} (X) = 0 . \end{array}

(2)

Introducing the penalty parameter

c > 0

, we can obtain the following penalized problem by taking a trade-off between the rank constraint and the least square distance

f (X)

\begin{array}{l} \min_{X \in 𝕊^{n}} & f (X) + c (λ_{r + 1} (X) + \dots + λ_{n} (X)) \\ s.t. & X_{i i} = 1, i = 1, \dots, n, \\ X ⪰ 0 . \end{array}

(3)

Define

p (X) ≔ \sum_{i = r + 1}^{n} λ_{i} (X) = ⟨ I, X ⟩ - \sum_{i = 1}^{r} λ_{i} (X),

where

I

is the identity matrix,

⟨ \cdot, \cdot ⟩

is the standard trace inner product in

𝕊^{n}

. We can rewrite problem (3) as

\begin{array}{l} \min_{X \in 𝕊^{n}} & f (X) + c p (X) \\ s.t. & X_{i i} = 1, i = 1, \dots, n, \\ X ⪰ 0 . \end{array}

(4)

The penalty parameter

c

is updated according to the progress of rank reduction. The input argument maxit controls the maximum number of updates of

c

The penalized problem (4) is not equivalent to the original problem (1) and the relationship can be described as follows. If the rank of the minimizer

X_{c}^{*}

to problem (4) is not larger than

r

, then

X_{c}^{*}

is a global optimal solution to problem (1), otherwise an

ε

-optimal solution to problem (1) is guaranteed given that parameter

c

satisfies some bound constraint. Please see Gao and Sun (2010) for more details.

11.2 Majorization approach

The focus now is on solving the penalty problem (4). Since

p (X)

is nonsmooth and concave, we majorize it by the linear function defined by its subgradient. For given

X^{k}

(the current iteration) and

U^{k} \in \partial p (X^{k})

, we have

p (X) \leq m_{k}^{p} (X) ≔ p (X^{k}) + ⟨ U^{k}, X - X^{k} ⟩ \forall X .

Now, instead of solving the nonconvex problem (4), we solve the following convex model:

\begin{array}{l} \min_{X \in 𝕊^{n}} & f (X) + c m_{k}^{p} (X) \\ s.t. & X_{i i} = 1, i = 1, \dots, n, \\ X ⪰ 0 . \end{array}

(5)

The framework combines ideas of a penalty method with majorization, it can be described as follows:

Majorized Penalty Algorithm (MPA)
1.Select a penalty parameter $c > 0$ and a feasible point $X^{0}$ , set $k ≔ 0$ . 2.Solve subproblem (5) to get $X^{k + 1} = {argmin}_{X} {f (X) + c m_{k}^{p} (X) \| X_{i i} = 1, i = 1, \dots, n, X ⪰ 0}$ . 3.If $X^{k + 1} = X^{k}$ , stop; otherwise, update penalty parameter $c$ , set $k ≔ k + 1$ and go to step 2.

Let

\bar{G} = G - c U^{k}

, the subproblem (5) is actually a nearest correlation matrix problem with input

\bar{G}

without rank constraint, which can be solved efficiently by g02aac. Input maxits controls the maximum number of iterations used in solving one problem (5) with fixed

c

For the convergence result of the algorithm, see Gao and Sun (2010). For other implementations as well as parameter setting strategies, see Qi and Yuan (2014) and Bai et al. (2015).

11.3 Stopping criteria

The algorithm shown in Table 1 is stopped when all the stopping criteria are satisfied to the requested accuracy, these are:

\frac{‖ \sqrt{2 f (X^{k})} - \sqrt{2 f (X^{k - 1})} ‖}{\max {100, \sqrt{2 f (X^{k - 1})}}} \leq ε_{1},   (relative precision)

\sum_{i = r + 1}^{n} λ_{i} (X^{k}) \leq ε_{2} .   (rank feasibility)

Here

ε_{1}

and

ε_{2}

may be set by arguments errtol and ranktol respectively in order to achieve various returned accuracy. The above quantity to measure rank feasibility does not scale well with the magnitude of