Pages that link to "Item:Q2259741"
From MaRDI portal
The following pages link to Fixed-rank matrix factorizations and Riemannian low-rank optimization (Q2259741):
Displaying 31 items.
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- Low-rank retractions: a survey and new results (Q496216) (← links)
- Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
- Dual dynamically orthogonal approximation of incompressible Navier Stokes equations with random boundary conditions (Q1700722) (← links)
- Riemannian gradient descent methods for graph-regularized matrix completion (Q2029849) (← links)
- Structured low-rank approximation: optimization on matrix manifold approach (Q2114475) (← links)
- Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
- Sparse matrices in data analysis (Q2259724) (← links)
- Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries (Q2259739) (← links)
- Majorized proximal alternating imputation for regularized rank constrained matrix completion (Q2297134) (← links)
- A Riemannian gossip approach to subspace learning on Grassmann manifold (Q2320541) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Riemannian preconditioning (Q2792408) (← links)
- Guarantees of Riemannian optimization for low rank matrix recovery (Q2818273) (← links)
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds (Q2967606) (← links)
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds (Q3300541) (← links)
- Dynamically Orthogonal Numerical Schemes for Efficient Stochastic Advection and Lagrangian Transport (Q4580294) (← links)
- Accelerated Alternating Projections for Robust Principal Component Analysis (Q4633028) (← links)
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries (Q4999366) (← links)
- A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
- GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733) (← links)
- Automatic Differentiation for Riemannian Optimization on Low-Rank Matrix and Tensor-Train Manifolds (Q5094222) (← links)
- A Riemannian Framework for Low-Rank Structured Elliptical Models (Q5103387) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections (Q5232119) (← links)
- Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints (Q5358961) (← links)
- A Geometric Approach to Dynamical Model Order Reduction (Q5373924) (← links)
- Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure (Q5739957) (← links)
- Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)
- The effect of smooth parametrizations on nonconvex optimization landscapes (Q6665380) (← links)
