Structure methods for solving the nearest correlation matrix problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7289878
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Computing the nearest correlation matrix--a problem from finance
- A preconditioned Newton algorithm for the nearest correlation matrix
- Computing a nearest correlation matrix with factor structure
Cites work
- A Dual Approach to Semidefinite Least-Squares Problems
- An Algorithm for Restricted Least Squares Regression
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Computational enhancements in low-rank semidefinite programming
- Computing the nearest correlation matrix--a problem from finance
- Efficient rank reduction of correlation matrices
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Functional Operators (AM-22), Volume 2
- Geometry of semidefinite Max-Cut relaxations via matrix ranks
- Local minima and convergence in low-rank semidefinite programming
- Numerically stable generation of correlation matrices and their factors
- Semidefinite programming for discrete optimization and matrix completion problems
Cited in
(17)- On Rebonato and Jäckel's parametrization method for finding nearest correlation matrices
- Newton's method for computing the nearest correlation matrix with a simple upper bound
- An application of the nearest correlation matrix on web document classification
- scientific article; zbMATH DE number 7289878 (Why is no real title available?)
- Decomposition methods for sparse matrix nearness problems
- On the low rank solution of the Q-weighted nearest correlation matrix problem.
- A class of multilevel structured low-rank approximation arising in material processing
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Alternative gradient algorithms for computing the nearest correlation matrix
- On Rebonato and Jäckel's parametrization method for finding nearest correlation matrices
- A preconditioned Newton algorithm for the nearest correlation matrix
- A lower bound for the nearest correlation matrix problem based on the circulant mean
- Computing the nearest correlation matrix--a problem from finance
- Semi-definite programming for the nearest circulant semi-definite matrix problem
- Computing a nearest correlation matrix with factor structure
- Correlation matrix nearness and completion under observation uncertainty
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming
This page was built for publication: Structure methods for solving the nearest correlation matrix problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q270046)
