Optimal low-rank approximation to a correlation matrix

From MaRDI portal
Publication:1870071

DOI10.1016/S0024-3795(02)00551-7zbMath1029.65062MaRDI QIDQ1870071

Zhenyue Zhang, Lixin Wu

Publication date: 4 May 2003

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




Related Items

Computing the nearest low-rank correlation matrix by a simplified SQP algorithm, A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices, A majorization algorithm for constrained correlation matrix approximation, Efficient rank reduction of correlation matrices, Penalty decomposition methods for rank minimization, Approximation of rank function and its application to the nearest low-rank correlation matrix, Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint, On the generalized low rank approximation of the correlation matrices arising in the asset portfolio, A global exact penalty for rank-constrained optimization problem and applications, Rank reduction of correlation matrices by majorization, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, A feasible filter method for the nearest low-rank correlation matrix problem, On the low rank solution of the Q‐weighted nearest correlation matrix problem, Calibrating low-rank correlation matrix problem: an SCA-based approach, Error bounds for rank constrained optimization problems and applications, Low rank approximation of the symmetric positive semidefinite matrix, An efficient method for convex constrained rank minimization problems based on DC programming, Nonnegative matrix factorization of a correlation matrix, An EZI Method to Reduce the Rank of a Correlation Matrix in Financial Modelling, Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm



Cites Work