Efficient rank reduction of correlation matrices
From MaRDI portal
(Redirected from Publication:875015)
Abstract: Geometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with the Lagrange multiplier method is established, along with an identification of whether a local minimum is a global minimum. An additional benefit of the geometric approach is that any weighted norm can be applied. The problem of finding the nearest low-rank correlation matrix occurs as part of the calibration of multi-factor interest rate market models to correlation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3174984 (Why is no real title available?)
- scientific article; zbMATH DE number 41813 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1303652 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3280665 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A method for the solution of certain non-linear problems in least squares
- A successive projection method
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An Algorithm for Restricted Least Squares Regression
- An EZI Method to Reduce the Rank of a Correlation Matrix in Financial Modelling
- Benchmarking optimization software with performance profiles.
- Computing the nearest correlation matrix--a problem from finance
- Continuous-time term structure models: Forward measure approach
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Geometric integration on manifold of square oblique rotation matrices
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interest rate models -- theory and practice
- LIBOR and swap market models and measures
- Lie groups
- Manifolds, tensor analysis, and applications.
- Newton's method on Riemannian manifolds: covariant alpha theory
- On a positive semidefinite relaxation of the cut polytope
- On the Facial Structure of the Set of Correlation Matrices
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- On the information in the interest rate term structure and option prices
- Optimal low-rank approximation to a correlation matrix
- Rank reduction of correlation matrices by majorization
- Review Paper. Interest–rate term–structure pricing models: a review
- Solving a class of semidefinite programs via nonlinear programming
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Geometry of Algorithms with Orthogonality Constraints
- The Market Model of Interest Rate Dynamics
- The multimode Procrustes problem
Cited in
(43)- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Analysis of asymptotic escape of strict saddle sets in manifold optimization
- Projected nonmonotone search methods for optimization with orthogonality constraints
- On the generalized low rank approximation of the correlation matrices arising in the asset portfolio
- A comparison of single factor Markov-functional and multi factor market models
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Riemannian Geometry of Symmetric Positive Definite Matrices via Cholesky Decomposition
- Adjusting covariance matrix for risk management
- A Black-Litterman approach to correlation stress testing
- Nonlinear damped oscillators on Riemannian manifolds: fundamentals
- An extended projective formula and its application to semidefinite optimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Uncovering the dynamics of correlation structures relative to the collective market motion
- A feasible method for optimization with orthogonality constraints
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- A novel method for a class of structured low-rank minimizations with equality constraint
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- Optimal low-rank approximation to a correlation matrix
- Nonnegative matrix factorization of a correlation matrix
- Rank reduction of correlation matrices by majorization
- On the low rank solution of the Q-weighted nearest correlation matrix problem.
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- A feasible filter method for the nearest low-rank correlation matrix problem
- Fast Computation of Latent Correlations
- An EZI Method to Reduce the Rank of a Correlation Matrix in Financial Modelling
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Penalty decomposition methods for rank minimization
- Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems
- Transportless conjugate gradient for optimization on Stiefel manifold
- Statistical corrections of invalid correlation matrices
- Structure methods for solving the nearest correlation matrix problem
- scientific article; zbMATH DE number 7289878 (Why is no real title available?)
- Kriging Riemannian Data via Random Domain Decompositions
- A majorization algorithm for constrained correlation matrix approximation
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Permutation-invariant log-Euclidean geometries on full-rank correlation matrices
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- Alternating projections on nontangential manifolds
- Parameterizing correlations: a geometric interpretation
- Statistical rehabilitation of improper correlation matrices
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
This page was built for publication: Efficient rank reduction of correlation matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875015)
