Munich Personal RePEc Archive
metadata only
Optimal solution of the nearest correlation matrix problem by minimization of the maximum norm
The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2. In the literature on this problem, 'nearest' is invariably defined in the se
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On generating correlated random variables with a given valid or invalid Correlation matrix#1274652
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#670305
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#668240
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- The nearest correlation matrix problem: Solution by differential evolution method of global optimization#1275142
Record · ID 1274653
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive