arXiv (All)
open access
Sparse Approximation via Polynomial Equations
We consider the problem of finding sparse solutions of an underdetermined linear system $Ax=b$. In contrast to conventional approaches based on greedy algorithms or convex relaxation, we reformulate sparse approximation as a structured system of polynomial equations and connect with the literature o
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
- Vector Balancing in Polynomial Time#1049279
- Semidefinite Implementations of the Proximal Point Algorithm and Consequences for Progressive Decoupling in Optimization#1049258
- SLRAアルゴリズムによる多変数多項式の近似decomposition (Computer Algebra --Foundations and Applications)#442744
- SLRAアルゴリズムによる多変数多項式の近似decomposition (Computer Algebra --Foundations and Applications)#442739
- A New Sparse Algorithm for Polynomial GCD over Integers#997628
Record · ID 998763
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