arXiv (All)
open access
The Normal Procrustes Problem: A Riemannian Optimization Approach
For given $m \times n$ data matrices $X, Y$, we investigate the Normal Procrustes Problem---the least squares optimization problem that aims to minimize $\|AX-Y\|_F^2$, where $A$ is constrained to be a normal $m \times m$ matrix. As far as the author of this article is aware, no other method that at
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
- Information Limits of Low-Rank Approximation Certification#1187999
- A proximal linearized NEP method for composite optimization with conic and manifold constraints#1084509
- CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs#987020
- Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement#1063732
- On the 100% Rule of Linear Programming#1296672
Record · ID 1356156
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