Skip to main content
Article thumbnail
Location of Repository

Optimal solution of the nearest correlation matrix problem by minimization of the maximum norm

By SK Mishra

Abstract

The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2. In the literature on this problem, 'nearest' is invariably defined in the sense of the least Frobenius norm. Research works of Rebonato and Jaeckel (1999), Higham (2002), Anjos et al. (2003), Grubisic and Pietersz (2004), Pietersz, and Groenen (2004), etc. use Frobenius norm explicitly or implicitly. However, it is not necessary to define 'nearest' in this conventional sense. The thrust of this paper is to define 'nearest' in the sense of the least maximum norm (LMN) of the deviation matrix (R-Q), and to obtain R nearest to Q. The LMN provides the overall minimum range of deviation of the elements of R from those of Q. We also append a computer program (source codes in FORTRAN) to find the LMN R from a given Q. Presently we use the random walk search method for optimization. However, we suggest that more efficient methods based on the Genetic algorithms may replace the random walk algorithm of optimization.

Topics: C61 - Optimization Techniques; Programming Models; Dynamic Analysis, C87 - Econometric Software, C88 - Other Computer Software, C82 - Methodology for Collecting, Estimating, and Organizing Macroeconomic Data
Year: 2004
DOI identifier: 10.2139/ssrn.573241
OAI identifier: oai:mpra.ub.uni-muenchen.de:1783

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.