Cites work
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3307161 (Why is no real title available?)
- A framework for robust subspace learning
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Convergence rate of incremental subgradient algorithms
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Exact matrix completion via convex optimization
- Fast and near-optimal matrix completion via randomized basis pursuit
- Global Optimality in Low-Rank Matrix Optimization
- Guaranteed Matrix Completion via Non-Convex Factorization
- Local minima and convergence in low-rank semidefinite programming
- Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
- Minimization of unsmooth functionals
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- On convergence rates of subgradient optimization methods
- On the quadratic convergence of the cubic regularization method under a local error bound condition
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Restricted p-Isometry Properties of Nonconvex Matrix Recovery
- Robust principal component analysis?
- Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
- Strong and Weak Convexity of Sets and Functions
- Subgradient methods for sharp weakly convex functions
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- The learnability of quantum states
- The non-convex geometry of low-rank matrix optimization
- The nonsmooth landscape of phase retrieval
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Variational Analysis
- Weak Sharp Minima in Mathematical Programming
Cited in
(39)- The global optimization geometry of shallow linear neural networks
- Matrix recovery from nonconvex regularized least absolute deviations
- scientific article; zbMATH DE number 7415096 (Why is no real title available?)
- Robust Matrix Completion with Heavy-Tailed Noise
- An inexact proximal majorization-minimization method for a class of image reconstruction models
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Sensitivity of low-rank matrix recovery
- A low-rank spectral method for learning Markov models
- Stochastic variance reduced gradient for affine rank minimization problem
- Nonconvex Matrix Factorization From Rank-One Measurements
- Non-convex exact community recovery in stochastic block model
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- Global stability of first-order methods for coercive tame functions
- A new complexity metric for nonconvex rank-one generalized matrix completion
- Max-norm optimization for robust matrix recovery
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
- Low rank matrix recovery with adversarial sparse noise
- An Unbiased Approach to Low Rank Recovery
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
- Nonsmooth rank-one matrix factorization landscape
- Recovery of low-rank matrices based on the rank null space properties
- Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search
- Nonconvex Robust Low-rank Matrix Recovery
- Gradient descent provably escapes saddle points in the training of shallow ReLU networks
- Low tubal-rank tensor recovery with adversarial sparse noises
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- A modification piecewise convexification method with a classification strategy for box-constrained non-convex optimization programs
- Low-Rank Matrix Recovery via Modified Schatten-$p$ Norm Minimization With Convergence Guarantees
- Stochastic optimization over proximally smooth sets
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- Revisiting subgradient method: complexity and convergence beyond Lipschitz continuity
- Low-Rank Matrix Recovery Via Robust Outlier Estimation
- Nonlinear tomographic reconstruction via nonsmooth optimization
- Gauss-Southwell type descent methods for low-rank matrix optimization
This page was built for publication: Nonconvex Robust Low-Rank Matrix Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217366)
