RTRMC

swMATH20435MaRDI QIDQ32253FDOQ32253

Author name not available (Why is that?)

Described by source

• Low-rank matrix completion via preconditioned optimization on the Grassmann manifold

Cited In (47)

• Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
• Nonlinear matrix recovery using optimization on the Grassmann manifold
• Intrinsic representation of tangent vectors and vector transports on matrix manifolds
• Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
• Dimension reduction via Gaussian ridge functions
• Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
• A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
• Toeplitz matrix completion via a low-rank approximation algorithm
• The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
• Pymanopt: a Python toolbox for optimization on manifolds using automatic differentiation
• Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds
• Robust bilinear factorization with missing and grossly corrupted observations
• Geometric subspace updates with applications to online adaptive nonlinear model reduction
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
• Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
• Fast singular value thresholding without singular value decomposition
• Riemannian preconditioning
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
• Continuation methods for Riemannian optimization
• Non intrusive method for parametric model order reduction using a bi-calibrated interpolation on the Grassmann manifold
• A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds
• A Trust-region Method for Nonsmooth Nonconvex Optimization
• Adaptive regularization with cubics on manifolds
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Robust low-rank matrix completion by Riemannian optimization
• A Riemannian optimization approach to the radial distribution network load flow problem
• A Broyden class of quasi-Newton methods for Riemannian optimization
• Low rank matrix completion by alternating steepest descent methods
• Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries
• A Riemannian symmetric rank-one trust-region method
• Implicit steepest descent algorithm for optimization with orthogonality constraints
• Proximal gradient method for nonsmooth optimization over the Stiefel manifold
• A Riemannian rank-adaptive method for low-rank matrix completion
• A Riemannian gossip approach to subspace learning on Grassmann manifold
• Blind deconvolution by a steepest descent algorithm on a quotient manifold
• Matrix recipes for hard thresholding methods
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• Recent advances in trust region algorithms
• A literature survey of low-rank tensor approximation techniques
• Majorized proximal alternating imputation for regularized rank constrained matrix completion
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• Recent Advances in Stochastic Riemannian Optimization
• Title not available (Why is that?)
• Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
• Accelerated low rank matrix approximate algorithms for matrix completion
• Guarantees of Riemannian optimization for low rank matrix completion

This page was built for software: RTRMC