![[höher]](/style/images/multi_up.png)
Eine Ebene höherGruppiert nach: Dokumententyp |
Veröffentlichungsdatum
Anzahl der Publikationen: 7
2016
Fornasier, Massimo; Peter, Steffen; Rauhut, Holger 
ORCID: https://orcid.org/0000-0003-4750-5092 und Worm, Stephan
(18. März 2016):
Conjugate gradient acceleration of iteratively re-weighted least squares methods.
In: Computational Optimization and Applications, Bd. 65, Nr. 1: S. 205-259
ORCID: https://orcid.org/0000-0003-4750-5092 und Worm, Stephan
(18. März 2016):
Conjugate gradient acceleration of iteratively re-weighted least squares methods.
In: Computational Optimization and Applications, Bd. 65, Nr. 1: S. 205-259
2011
Fornasier, Massimo; Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092 und Ward, Rachel
(2011):
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization.
In: SIAM Journal on Optimization, Bd. 21, Nr. 4: S. 1614-1640
ORCID: https://orcid.org/0000-0003-4750-5092 und Ward, Rachel
(2011):
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization.
In: SIAM Journal on Optimization, Bd. 21, Nr. 4: S. 1614-1640
2010
Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092
(2010):
Compressive Sensing and Structured Random Matrices.
In: Fornasier, Massimo (Hrsg.):
Theoretical Foundations and Numerical Methods for Sparse Recovery. Radon Series on Computational and Applied Mathematics, Bd. 9. Berlin ; New York, NY: De Gruyter. S. 1-92
ORCID: https://orcid.org/0000-0003-4750-5092
(2010):
Compressive Sensing and Structured Random Matrices.
In: Fornasier, Massimo (Hrsg.):
Theoretical Foundations and Numerical Methods for Sparse Recovery. Radon Series on Computational and Applied Mathematics, Bd. 9. Berlin ; New York, NY: De Gruyter. S. 1-92
2008
Fornasier, Massimo und Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092
(2008):
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints.
In: SIAM Journal on Numerical Analysis, Bd. 46, Nr. 2: S. 577-613
ORCID: https://orcid.org/0000-0003-4750-5092
(2008):
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints.
In: SIAM Journal on Numerical Analysis, Bd. 46, Nr. 2: S. 577-613
Fornasier, Massimo und Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092
(2008):
Iterative thresholding algorithms.
In: Applied and Computational Harmonic Analysis, Bd. 25, Nr. 2: S. 187-208
ORCID: https://orcid.org/0000-0003-4750-5092
(2008):
Iterative thresholding algorithms.
In: Applied and Computational Harmonic Analysis, Bd. 25, Nr. 2: S. 187-208
2007
Dahlke, Stephan; Fornasier, Massimo; Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092; Steidl, Gabriele und Teschke, Gerd
(2007):
Generalized coorbit theory, Banach frames, and the relation to α-modulation spaces.
In: Proceedings of the London Mathematical Society, Bd. 96, Nr. 2: S. 464-506
ORCID: https://orcid.org/0000-0003-4750-5092; Steidl, Gabriele und Teschke, Gerd
(2007):
Generalized coorbit theory, Banach frames, and the relation to α-modulation spaces.
In: Proceedings of the London Mathematical Society, Bd. 96, Nr. 2: S. 464-506
2005
Fornasier, Massimo und Rauhut, Holger ORCID: https://orcid.org/0000-0003-4750-5092
(2005):
Continuous Frames, Function Spaces, and the Discretization Problem.
In: Journal of Fourier Analysis and Applications, Bd. 11, Nr. 3: S. 245-287
ORCID: https://orcid.org/0000-0003-4750-5092
(2005):
Continuous Frames, Function Spaces, and the Discretization Problem.
In: Journal of Fourier Analysis and Applications, Bd. 11, Nr. 3: S. 245-287