Exact matrix completion via convex optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- Adaptive estimation of a quadratic functional by model selection.
- Characterization of the subdifferential of some matrix norms
- Compressed sensing
- Concentration around the mean for maxima of empirical processes
- Decoding by Linear Programming
- Decoupling and Khintchine's inequalities for \(U\)-statistics
- Decoupling inequalities for the tail probabilities of multivariate \(U\)- statistics
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New concentration inequalities in product spaces
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Operator Khintchine inequality in non-commutative probability
- Random vectors in the isotropic position
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling from large matrices
- Semidefinite Programming
- Sparsity and incoherence in compressive sampling
- Spectral analysis of data
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- The concentration of measure phenomenon
- The geometry of graphs and some of its algorithmic applications
- The mathematics of eigenvalue optimization
- The singular values of a Hadamard product: a basic inequality
- Theory of semidefinite programming for sensor network localization
Cited in
(only showing first 100 items - show all)- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- A decoupled method for image inpainting with patch-based low rank regulariztion
- Flexible low-rank statistical modeling with missing data and side information
- A note on the orthogonal Procrustes problem and norm-dependent optimality
- Matrix Completion under Low-Rank Missing Mechanism
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Reconstruction of a low-rank matrix in the presence of Gaussian noise
- Generalized conditional gradient for sparse estimation
- Alternating direction method of multipliers for generalized low-rank tensor recovery
- Robust covariance estimation for approximate factor models
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Structured volatility matrix estimation for non-synchronized high-frequency financial data
- Noise-tolerance matrix completion for location recommendation
- A Unifying Tutorial on Approximate Message Passing
- A general theory of singular values with applications to signal denoising
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- Accelerated linearized Bregman method
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
- Learning non-parametric basis independent models from point queries via low-rank methods
- On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors
- On polynomial time methods for exact low-rank tensor completion
- A smoothing proximal gradient algorithm for matrix rank minimization problem
- New and explicit constructions of unbalanced Ramanujan bipartite graphs
- Convex graph invariant relaxations for graph edit distance
- Statistical analysis of \(k\)-nearest neighbor collaborative recommendation
- Computational barriers in minimax submatrix detection
- Imputed mean tensor regression for near-sited spatial temporal data
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Low-rank tensor completion via smooth matrix factorization
- RIPless compressed sensing from anisotropic measurements
- Tensor completion by multi-rank via unitary transformation
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Spectral regularization algorithms for learning large incomplete matrices
- On the equivalence between low-rank matrix completion and tensor rank
- Nonconvex \(L_{1/2}\)-regularized nonlocal self-similarity denoiser for compressive sensing based CT reconstruction
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Discussion: Latent variable graphical model selection via convex optimization
- Robust bilinear factorization with missing and grossly corrupted observations
- On the generation of random stable polynomials
- Affine matrix rank minimization problem via non-convex fraction function penalty
- Mean estimation with sub-Gaussian rates in polynomial time
- An iterative method for tensor inpainting based on higher-order singular value decomposition
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- A separable surrogate function method for sparse and low-rank matrices decomposition
- Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Estimation of a sparse and spiked covariance matrix
- Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
- Inference in adaptive regression via the Kac-Rice formula
- Optimal large-scale quantum state tomography with Pauli measurements
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Approximation of frame based missing data recovery
- A quadratically convergent algorithm for structured low-rank approximation
- Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Robust finite mixture regression for heterogeneous targets
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- A mixture of nuclear norm and matrix factorization for tensor completion
- Tensor completion using total variation and low-rank matrix factorization
- Super-resolution of point sources via convex programming
- Fast iterative regularization by reusing data
- Noisy tensor completion via the sum-of-squares hierarchy
- An Exact and Robust Conformal Inference Method for Counterfactual and Synthetic Controls
- Non-asymptotic approach to varying coefficient model
- Matrix estimation by universal singular value thresholding
- The geometry of least squares in the 21st century
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- Manifold based low-rank regularization for image restoration and semi-supervised learning
- On the singular values of matrices with high displacement rank
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Rejoinder: Latent variable graphical model selection via convex optimization
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- High-dimensional change-point estimation: combining filtering with convex optimization
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings
- A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Scaled Coupled Norms and Coupled Higher-Order Tensor Completion
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
- Spectral operators of matrices
- Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- Von Neumann entropy penalization and low-rank matrix estimation
- Matrix completion with covariate information
- Decomposition of Variation of Mixed Variables by a Latent Mixed Gaussian Copula Model
- A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm
- DC formulations and algorithms for sparse optimization problems
- Distance geometry for kissing spheres
- High resolution 3D imaging in MIMO radar with sparse array
- The degrees of freedom of partly smooth regularizers
- Fast randomized numerical rank estimation for numerically low-rank matrices
- Quaternion-based color image completion via logarithmic approximation
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- scientific article; zbMATH DE number 7164697 (Why is no real title available?)
- Tensor theta norms and low rank recovery
- Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity
This page was built for publication: Exact matrix completion via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655288)
