An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration (Q6053418)
From MaRDI portal
scientific article; zbMATH DE number 7752099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration |
scientific article; zbMATH DE number 7752099 |
Statements
An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration (English)
0 references
18 October 2023
0 references
convergence analysis
0 references
stationarity
0 references
low-rank optimization
0 references
determinantal variety
0 references
first-order method
0 references
tangent cones
0 references
QR factorization
0 references
singular value decomposition
0 references
0 references
0 references
