Pages that link to "Item:Q4609500"
From MaRDI portal
The following pages link to Sparse Approximation by Greedy Algorithms (Q4609500):
Displaying 12 items.
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Sparse representations and approximation theory (Q630502) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm (Q2930345) (← links)
- Average Performance of the Sparsest Approximation Using a General Dictionary (Q3173502) (← links)
- Sparse approximation based on a random overcomplete basis (Q3302727) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- A Greedy Algorithm for Sparse Precision Matrix Approximation (Q5079528) (← links)
- Efficient Least Residual Greedy Algorithms for Sparse Recovery (Q5102914) (← links)
- Sparse Approximation via Penalty Decomposition Methods (Q5408227) (← links)
- Sparse approximation using new greedy-like bases in superreflexive spaces (Q6085653) (← links)