arXiv (All)
open access
Polynomial-Time Algorithms for Nuclear Tensor Norms and Multipartite Separability
We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the $k$ local factors of dimension $d$ is chosen from a convex set. We give a deterministic algorithm running in time $d^{O(k)}$ for constant additive approximations. As applications, we obtain the fir
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
- Tensor nuclear norm minimization with linear constraints#1117931
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming#1035072
- GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport#1200366
- Sparse plus low-rank matrix embedding with applications in cancer radiotherapy optimization#972746
- Operator Norm Bounds for Multi-leg Matrix Tensors and Applications to Random Matrix Theory#1156312
Record · ID 1188348
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