- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Numerical Algorithms, 93, 2, S. 669-693
- Event
-
Veröffentlichung
- (where)
-
Augsburg
- (who)
-
Universität Augsburg
- (when)
-
2023
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Springer Science and Business Media LLC
- (when)
-
2023
- Creator
- DOI
-
10.1007/s11075-022-01433-5
- URN
-
urn:nbn:de:bvb:384-opus4-1022036
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:53 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Eisenmann, Henrik
- Krahmer, Felix
- Pfeffer, Max
- Uschmajew, André
- Universität Augsburg
- Springer Science and Business Media LLC
Time of origin
- 2023
Other Objects (12)
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems
A Riemannian rank-adaptive method for low-rank matrix completion
A Riemannian rank-adaptive method for low-rank matrix completion
Improved iterative shrinkage-thresholding for sparse signal recovery via Laplace mixtures models
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Implicit Low-Rank Riemannian Schemes for the Time Integration of Stiff Partial Differential Equations
Topics in learning sparse and low-rank models of non-negative data
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
Compressive Higher-order Sparse and Low-Rank Acquisition with a Hyperspectral Light Stage
Spectral weighted sparse unmixing based on adaptive total variation and low-rank constraints
Hyperspectral anomaly detection via low-rank and sparse decomposition with cluster subspace accumulation
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems
A Riemannian rank-adaptive method for low-rank matrix completion
A Riemannian rank-adaptive method for low-rank matrix completion
Improved iterative shrinkage-thresholding for sparse signal recovery via Laplace mixtures models
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Implicit Low-Rank Riemannian Schemes for the Time Integration of Stiff Partial Differential Equations
Topics in learning sparse and low-rank models of non-negative data
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
Compressive Higher-order Sparse and Low-Rank Acquisition with a Hyperspectral Light Stage
Spectral weighted sparse unmixing based on adaptive total variation and low-rank constraints
Hyperspectral anomaly detection via low-rank and sparse decomposition with cluster subspace accumulation
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems
A Riemannian rank-adaptive method for low-rank matrix completion
A Riemannian rank-adaptive method for low-rank matrix completion
Improved iterative shrinkage-thresholding for sparse signal recovery via Laplace mixtures models
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Implicit Low-Rank Riemannian Schemes for the Time Integration of Stiff Partial Differential Equations
Topics in learning sparse and low-rank models of non-negative data
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
Compressive Higher-order Sparse and Low-Rank Acquisition with a Hyperspectral Light Stage
Spectral weighted sparse unmixing based on adaptive total variation and low-rank constraints