IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/1783.html
   My bibliography  Save this paper

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

Author

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.

Suggested Citation

  • Mishra, SK, 2004. "Optimal solution of the nearest correlation matrix problem by minimization of the maximum norm," MPRA Paper 1783, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:1783
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/1783/1/MPRA_paper_1783.pdf
    File Function: original version
    Download Restriction: no

    References listed on IDEAS

    as
    1. Raoul Pietersz & Patrick Groenen, 2004. "Rank reduction of correlation matrices by majorization," Quantitative Finance, Taylor & Francis Journals, vol. 4(6), pages 649-662.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sudhanshu K Mishra, 2013. "Global Optimization of Some Difficult Benchmark Functions by Host-Parasite Coevolutionary Algorithm," Economics Bulletin, AccessEcon, vol. 33(1), pages 1-18.
    2. Mishra, SK, 2007. "Completing correlation matrices of arbitrary order by differential evolution method of global optimization: A Fortran program," MPRA Paper 2000, University Library of Munich, Germany.

    More about this item

    Keywords

    Nearest correlation matrix problem; Frobenius norm; maximum norm; LMN correlation matrix; positive semidefinite; negative semidefinite; positive definite; random walk algorithm; Genetic algorithm; computer program; source codes; FORTRAN; simulation;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C87 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Econometric Software
    • C88 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Other Computer Software
    • C82 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Methodology for Collecting, Estimating, and Organizing Macroeconomic Data; Data Access

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:1783. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter) or (Rebekah McClure). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.