Low-Rank Matrix Completion by Riemannian Optimization
From MaRDI portal
Publication:2848192
DOI10.1137/110845768zbMath1277.15021arXiv1209.3834OpenAlexW2058078260WikidataQ115247017 ScholiaQ115247017MaRDI QIDQ2848192
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.3834
matrix completionRiemannian manifoldsnonlinear conjugate gradientsdifferential geometrylow-rank matricesoptimization on manifolds
Numerical mathematical programming methods (65K05) Methods of local Riemannian geometry (53B21) Matrix completion problems (15A83)
Related Items
A penalty method for rank minimization problems in symmetric matrices ⋮ \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds ⋮ Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Adaptive Quadratically Regularized Newton Method for Riemannian Optimization ⋮ Differentiable Piecewise-Bézier Surfaces on Riemannian Manifolds ⋮ Unnamed Item ⋮ Optimization on flag manifolds ⋮ Tensor Completion in Hierarchical Tensor Representations ⋮ Optimization on matrix manifold based on gradient information and its applications in network control ⋮ Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Alternating Least Squares as Moving Subspace Correction ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds ⋮ Fenchel Duality and a Separation Theorem on Hadamard Manifolds ⋮ Continuation Methods for Riemannian Optimization ⋮ Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit ⋮ Low-rank nonnegative matrix factorization on Stiefel manifold ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds ⋮ Automatic Differentiation for Riemannian Optimization on Low-Rank Matrix and Tensor-Train Manifolds ⋮ A Broyden Class of Quasi-Newton Methods for Riemannian Optimization ⋮ The geometry of algorithms using hierarchical tensors ⋮ A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy ⋮ Empirical Bayes matrix completion ⋮ Low-rank tensor completion by Riemannian optimization ⋮ An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization ⋮ Proximal linearization methods for Schatten \(p\)-quasi-norm minimization ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ Matrix completion with sparse measurement errors ⋮ Low rank matrix completion by alternating steepest descent methods ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ Accelerated low rank matrix approximate algorithms for matrix completion ⋮ A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ Painless breakups -- efficient demixing of low rank matrices ⋮ An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ A brief introduction to manifold optimization ⋮ Low-rank Riemannian eigensolver for high-dimensional Hamiltonians ⋮ Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ Recent Advances in Stochastic Riemannian Optimization ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Jacobi--Davidson Method on Low-Rank Matrix Manifolds ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ Low-rank retractions: a survey and new results ⋮ The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion ⋮ Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices ⋮ Nonnegative low rank matrix approximation for nonnegative matrices ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ An efficient method for non-negative low-rank completion ⋮ One-bit tensor completion via transformed tensor singular value decomposition ⋮ Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion ⋮ A Riemannian subspace limited-memory SR1 trust region method ⋮ Intrinsic representation of tangent vectors and vector transports on matrix manifolds ⋮ Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries ⋮ Fixed-rank matrix factorizations and Riemannian low-rank optimization ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ Unnamed Item ⋮ Nonconvex weak sharp minima on Riemannian manifolds ⋮ Riemannian conjugate gradient methods with inverse retraction ⋮ Hybrid Riemannian conjugate gradient methods with global convergence properties ⋮ Riemannian Preconditioning ⋮ Riemannian gradient descent methods for graph-regularized matrix completion ⋮ A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds ⋮ Reduction of nonlinear embedded boundary models for problems with evolving interfaces ⋮ Robust principal component pursuit via inexact alternating minimization on matrix manifolds ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Sufficient descent Riemannian conjugate gradient methods ⋮ Majorized proximal alternating imputation for regularized rank constrained matrix completion ⋮ Fast Cadzow's algorithm and a gradient variant ⋮ Efficient Weingarten map and curvature estimation on manifolds ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ A gradient system for low rank matrix completion ⋮ A new method based on the manifold-alternative approximating for low-rank matrix completion ⋮ Reconstruction of jointly sparse vectors via manifold optimization ⋮ Robust Low-Rank Matrix Completion by Riemannian Optimization ⋮ Riemannian Optimization for High-Dimensional Tensor Completion ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections ⋮ Toeplitz matrix completion via a low-rank approximation algorithm ⋮ Accelerated Alternating Projections for Robust Principal Component Analysis ⋮ Riemannian optimization for phase retrieval from masked Fourier measurements ⋮ A Riemannian rank-adaptive method for low-rank matrix completion ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold ⋮ Unnamed Item ⋮ Stability analysis of hierarchical tensor methods for time-dependent PDEs ⋮ A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization ⋮ Riemannian Multigrid Line Search for Low-Rank Problems ⋮ Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries ⋮ Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion ⋮ Sensitivity of low-rank matrix recovery ⋮ Nonlinear matrix recovery using optimization on the Grassmann manifold ⋮ Hierarchical compressed sensing ⋮ Low-rank matrix completion via preconditioned optimization on the Grassmann manifold ⋮ A NONLOCAL LOW-RANK REGULARIZATION METHOD FOR FRACTAL IMAGE CODING ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy ⋮ Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation ⋮ A Riemannian subspace BFGS trust region method ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ A framework of regularized low-rank matrix models for regression and classification ⋮ Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ Fast gradient method for low-rank matrix estimation ⋮ Adaptive trust-region method on Riemannian manifold ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Riemannian conjugate gradient method for low-rank tensor completion ⋮ An image inpainting algorithm using exemplar matching and low-rank sparse prior ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods ⋮ Desingularization of Bounded-Rank Matrix Sets ⋮ A Geometric Approach to Dynamical Model Order Reduction ⋮ Accurate and fast matrix factorization for low-rank learning. ⋮ Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure ⋮ Preserving Lagrangian Structure in Nonlinear Model Reduction with Application to Structural Dynamics ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Computing Eigenspaces With Low Rank Constraints
Uses Software
This page was built for publication: Low-Rank Matrix Completion by Riemannian Optimization
