arxiv
PublishedMay 22, 2026 at 4:00 AM
—neutral
Compact Lifted Relaxations for Low-Rank Optimization
Publisher summary· verbatim
arXiv:2603.20228v2 Announce Type: replace-cross Abstract: We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral s
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSvarna: An Open Corpus Workbench for Modern Greek10harxivPLURAL: A Global Dataset for Value Alignment10harxivValidating LLMs in social science: Epistemic threats and emerging norms10harxivHow Do I Know What to Say Next? Barenholtz's Autogenerative Theory as an Enrichment of Harrisean Integrationism10hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗