City Research Online

Efficient PSD Matrix Approximation by Iterative Optimisations and Gradient Descent Method

Wang, R., Asimit, V. ORCID: 0000-0002-7706-0066, Zhu, R. ORCID: 0000-0002-9944-0369 & Zhou, F. (2024). Efficient PSD Matrix Approximation by Iterative Optimisations and Gradient Descent Method.


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. The first method converts the PSDisation problem with a positive semidefinite constraint and other linear constraints into iterative linear programmings (LP) or quadratic programmings (QP). 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 userdefined constraints. Secondly, 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. Examples of applications in finance as well as machine learning field are given. Computational results are presented followed by discussion on future improvements.

Publication Type: Other (Preprint)
Publisher Keywords: Nearest correlation matrix; Positive semidefinite; Semidefinite programming
Subjects: H Social Sciences > HG Finance
Q Science > QA Mathematics
Departments: Bayes Business School
Bayes Business School > Actuarial Science & Insurance
SWORD Depositor:
[thumbnail of PSD_WAZZ_2024.pdf]
Text - Pre-print
Download (419kB) | Preview


Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login