Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
From MaRDI portal
Publication:2347362
Recommendations
- Low-rank matrix completion by Riemannian optimization
- Guarantees of Riemannian optimization for low rank matrix recovery
- Riemannian gradient descent methods for graph-regularized matrix completion
- Guarantees of Riemannian optimization for low rank matrix completion
- A Riemannian rank-adaptive method for low-rank matrix completion
Cites work
- A Geometric Approach to Low-Rank Matrix Completion
- A new, globally convergent Riemannian conjugate gradient method
- A Singular Value Thresholding Algorithm for Matrix Completion
- A survey of nonlinear conjugate gradient methods
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Exact matrix completion via convex optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3960432 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Low-rank matrix approximation with weights or missing data is NP-hard
- Low-rank matrix completion by Riemannian optimization
- Low-rank optimization with trace norm penalty
- Manopt, a Matlab toolbox for optimization on manifolds
- Matrix completion from noisy entries
- Matrix estimation by universal singular value thresholding
- Numerical Optimization
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Rank-Sparsity Incoherence for Matrix Decomposition
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Regularization, optimization, kernels, and support vector machines
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
- Trust Region Methods
- Trust-region methods on Riemannian manifolds
- Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries
- Zur Riemannschen Geometrie in Grassmannschen Mannigfaltigkeiten
Cited in
(37)- Riemannian gradient descent methods for graph-regularized matrix completion
- A Riemannian rank-adaptive method for low-rank matrix completion
- Nonlinear matrix recovery using optimization on the Grassmann manifold
- Non intrusive method for parametric model order reduction using a bi-calibrated interpolation on the Grassmann manifold
- Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Majorized proximal alternating imputation for regularized rank constrained matrix completion
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Robust low-rank matrix completion by Riemannian optimization
- Low-rank matrix completion by Riemannian optimization
- RTRMC
- Geometric subspace updates with applications to online adaptive nonlinear model reduction
- A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
- Dimension reduction via Gaussian ridge functions
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Continuation methods for Riemannian optimization
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Sparsifying the resolvent forcing mode via gradient-based optimisation
- A Grassmann manifold handbook: basic geometry and computational aspects
- Riemannian Natural Gradient Methods
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- Embedding graphs on Grassmann manifold
- Robust optimization and inference on manifolds
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations
- Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification
- A preconditioned Riemannian gradient descent algorithm for low-rank matrix recovery
- A decentralized proximal gradient tracking algorithm for composite optimization on Riemannian manifolds
- Parametric reduced-order modelling and mode sensitivity of actuated cylinder flow from a matrix manifold perspective
- Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds embedded in the Euclidean space
- Optimization on product manifolds under a preconditioned metric
- Approximation Newton method for low-rank matrix completion
- Multipliers correction methods for optimization problems over the Stiefel manifold
- Accelerated gradient methods on the Grassmann and Stiefel manifolds
- Preconditioned low-rank Riemannian optimization for symmetric positive definite linear matrix equations
- A Riemannian method on quotient manifolds for solving generalized Lyapunov equations
- Calabi-Yau metrics through Grassmannian learning and Donaldson's algorithm
- An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
This page was built for publication: Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347362)
