Efficient rank reduction of correlation matrices

From MaRDI portal
Publication:875015

DOI10.1016/j.laa.2006.11.024zbMath1112.65036arXivcond-mat/0403477OpenAlexW3125769231MaRDI QIDQ875015

Raoul Pietersz, Igor Grubišić

Publication date: 10 April 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0403477




Related Items (35)

Structure methods for solving the nearest correlation matrix problemAnalysis of Asymptotic Escape of Strict Saddle Sets in Manifold OptimizationComputing the nearest low-rank correlation matrix by a simplified SQP algorithmA majorization algorithm for constrained correlation matrix approximationKriging Riemannian Data via Random Domain DecompositionsNonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian methodA novel method for a class of structured low-rank minimizations with equality constraintPenalty decomposition methods for rank minimizationApproximation of rank function and its application to the nearest low-rank correlation matrixAlternating projections on nontangential manifoldsTransportless conjugate gradient for optimization on Stiefel manifoldNonlinear damped oscillators on Riemannian manifolds: fundamentalsOn the generalized low rank approximation of the correlation matrices arising in the asset portfolioAn equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programsGeneralized left-localized Cayley parametrization for optimization with orthogonality constraintsA New First-Order Algorithmic Framework for Optimization Problems with Orthogonality ConstraintsA non-monotone linear search algorithm with mixed direction on Stiefel manifoldAdjusting covariance matrix for risk managementA feasible filter method for the nearest low-rank correlation matrix problemAn extended projective formula and its application to semidefinite optimizationProjected nonmonotone search methods for optimization with orthogonality constraintsA comparison of single factor Markov-functional and multi factor market modelsOn the low rank solution of the Q‐weighted nearest correlation matrix problemA Riemannian conjugate gradient method for optimization on the Stiefel manifoldA feasible method for optimization with orthogonality constraintsRiemannian inexact Newton method for structured inverse eigenvalue and singular value problemsRiemannian Geometry of Symmetric Positive Definite Matrices via Cholesky DecompositionA framework of constraint preserving update schemes for optimization on Stiefel manifoldStatistical rehabilitation of improper correlation matricesNonnegative matrix factorization of a correlation matrixA Black–Litterman approach to correlation stress testingGlobal convergence of Riemannian line search methods with a Zhang-Hager-type conditionUncovering the dynamics of correlation structures relative to the collective market motionUnnamed ItemStatistical Corrections of Invalid Correlation Matrices


Uses Software


Cites Work


This page was built for publication: Efficient rank reduction of correlation matrices