Local convergence of alternating low‐rank optimization methods with overrelaxation
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Numerical Linear Algebra with Applications, 30, 3, S. e2459-
- Event
-
Veröffentlichung
- (where)
-
Augsburg
- (who)
-
Universität Augsburg
- (when)
-
2023
- Event
-
Veröffentlichung
- (where)
-
Weinheim
- (who)
-
Wiley
- (when)
-
2023
- Creator
- DOI
-
10.1002/nla.2459
- URN
-
urn:nbn:de:bvb:384-opus4-1031124
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 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
- Oseledets, Ivan V.
- Rakhuba, Maxim V.
- Uschmajew, André
- Universität Augsburg
- Wiley
Time of origin
- 2023
Other Objects (12)
Low-Rank Alternating Direction Implicit Iteration in pyMOR
Low-rank Parareal: a low-rank parallel-in-time integrator
On the convergence of Krylov methods with low-rank truncations
From low-rank retractions to dynamical low-rank approximation and back
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
Low-rank Tensor Recovery
Stagnated Liberalization, Long‐term Convergence, and Index Methodology: Three Lessons from the CITRIX Citizenship Policy Dataset
Learning-based low-rank denoising
Ranks and Pseudo‐ranks—Surprising Results of Certain Rank Tests in Unbalanced Designs
Ada for software engineers, Buch.
Special issue: Fats and oils as renewable feedstock for the chemical industry
Ready-to-run Delphi 3.0 algorithms, Buch.
Low-Rank Alternating Direction Implicit Iteration in pyMOR
Low-rank Parareal: a low-rank parallel-in-time integrator
On the convergence of Krylov methods with low-rank truncations
From low-rank retractions to dynamical low-rank approximation and back
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
Low-rank Tensor Recovery
Stagnated Liberalization, Long‐term Convergence, and Index Methodology: Three Lessons from the CITRIX Citizenship Policy Dataset
Learning-based low-rank denoising
Ranks and Pseudo‐ranks—Surprising Results of Certain Rank Tests in Unbalanced Designs
Ada for software engineers, Buch.
Special issue: Fats and oils as renewable feedstock for the chemical industry
Ready-to-run Delphi 3.0 algorithms, Buch.
Low-Rank Alternating Direction Implicit Iteration in pyMOR
Low-rank Parareal: a low-rank parallel-in-time integrator
On the convergence of Krylov methods with low-rank truncations
From low-rank retractions to dynamical low-rank approximation and back
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
Low-rank Tensor Recovery
Stagnated Liberalization, Long‐term Convergence, and Index Methodology: Three Lessons from the CITRIX Citizenship Policy Dataset
Learning-based low-rank denoising
Ranks and Pseudo‐ranks—Surprising Results of Certain Rank Tests in Unbalanced Designs
Ada for software engineers, Buch.
Special issue: Fats and oils as renewable feedstock for the chemical industry