IDEAS home Printed from https://ideas.repec.org/a/gam/jrisks/v13y2025i2p28-d1585739.html
   My bibliography  Save this article

Efficient Positive Semidefinite Matrix Approximation by Iterative Optimisations and Gradient Descent Method

Author

Listed:
  • Vali Asimit

    (Bayes Business School, City St George’s, University of London, 106 Bunhill Row, London EC1Y 8TZ, UK)

  • Runshi Wang

    (Bayes Business School, City St George’s, University of London, 106 Bunhill Row, London EC1Y 8TZ, UK)

  • Feng Zhou

    (MRC Biostatistics Unit, University of Cambridge, Cambridge CB2 0SR, UK)

  • Rui Zhu

    (Bayes Business School, City St George’s, University of London, 106 Bunhill Row, London EC1Y 8TZ, UK)

Abstract

We devise two algorithms for approximating solutions of PSDisation, a problem in actuarial science and finance, to find the nearest valid correlation matrix that is positive semidefinite (PSD). The first method converts the PSDisation problem with a positive semidefinite constraint and other linear constraints into iterative Linear Programmings (LPs) or Quadratic Programmings (QPs). The LPs or QPs in our formulation give an upper bound of the optimal solution of the original problem, which can be improved during each iteration. The biggest advantage of this iterative method is its great flexibility when working with different choices of norms or with user-defined constraints. Second, a gradient descent method is designed specifically for PSDisation under the Frobenius norm to measure how close the two metrices are. Experiments on randomly generated data show that this method enjoys better resilience to noise while maintaining good accuracy. For example, in our experiments with noised data, the iterative quadratic programming algorithm performs best in more than 41% to 67% of the samples when the standard deviation of noise is 0.02, and the gradient descent method performs best in more than 70% of the samples when the standard deviation of noise is 0.2. Examples of applications in finance, as well as in the machine learning field, are given. Computational results are presented followed by discussion on future improvements.

Suggested Citation

  • Vali Asimit & Runshi Wang & Feng Zhou & Rui Zhu, 2025. "Efficient Positive Semidefinite Matrix Approximation by Iterative Optimisations and Gradient Descent Method," Risks, MDPI, vol. 13(2), pages 1-25, February.
    • Handle: RePEc:gam:jrisks:v:13:y:2025:i:2:p:28-:d:1585739
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-9091/13/2/28/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-9091/13/2/28/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Stefan Cutajar & Helena Smigoc & Adrian O’Hagan, 2017. "Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem," North American Actuarial Journal, Taylor & Francis Journals, vol. 21(4), pages 552-564, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vainora, J., 2024. "Asymptotic Theory Under Network Stationarity," Cambridge Working Papers in Economics 2439, Faculty of Economics, University of Cambridge.
    2. Xavier Milhaud & Victorien Poncelet & Clement Saillard, 2018. "Operational Choices for Risk Aggregation in Insurance: PSDization and SCR Sensitivity," Risks, MDPI, vol. 6(2), pages 1-23, April.

    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:gam:jrisks:v:13:y:2025:i:2:p:28-:d:1585739. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.