Pages that link to "Item:Q2655288"

The following pages link to Exact matrix completion via convex optimization (Q2655288):

Displaying 50 items.

• Leveraging mixed and incomplete outcomes via reduced-rank modeling (Q105484) (← links)
• Geometric median and robust estimation in Banach spaces (Q122792) (← links)
• Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification (Q123602) (← links)
• Latent variable graphical model selection via convex optimization (Q132216) (← links)
• Asymptotic normality and optimalities in estimation of large Gaussian graphical models (Q152845) (← links)
• Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
• An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
• A novel robust principal component analysis method for image and video processing. (Q265164) (← links)
• Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas (Q265300) (← links)
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems (Q276859) (← links)
• Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
• Inference in adaptive regression via the Kac-Rice formula (Q282472) (← links)
• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint (Q286265) (← links)
• Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
• A new gradient projection method for matrix completion (Q300199) (← links)
• On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• A proximal method for composite minimization (Q304260) (← links)
• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Geometric inference for general high-dimensional linear inverse problems (Q309721) (← links)
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• Using shapes correlation for active contour segmentation of uterine fibroid ultrasound images in computer-aided therapy (Q320598) (← links)
• Estimation of matrices with row sparsity (Q327303) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Sharp MSE bounds for proximal denoising (Q330102) (← links)
• On tensor completion via nuclear norm minimization (Q330103) (← links)
• A graphical approach to the analysis of matrix completion (Q335673) (← links)
• Tucker factorization with missing data with application to low-\(n\)-rank tensor completion (Q335961) (← links)
• Low rank matrix recovery from rank one measurements (Q347516) (← links)
• Low rank estimation of smooth kernels on graphs (Q355091) (← links)
• The bounds of restricted isometry constants for low rank matrices recovery (Q365859) (← links)
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit (Q368099) (← links)
• \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
• The geometry of least squares in the 21st century (Q373539) (← links)
• Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
• Simple bounds for recovering low-complexity models (Q378116) (← links)
• Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions (Q380304) (← links)
• Arithmetic modeling of random processes and \(r\)-algorithms (Q380647) (← links)
• Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
• Reconstruction of a low-rank matrix in the presence of Gaussian noise (Q391623) (← links)
• Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
• An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
• Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications (Q426078) (← links)
• An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
• Uniqueness conditions for low-rank matrix recovery (Q442534) (← links)
• Sampling, denoising and compression of matrices by coherent matrix organization (Q448484) (← links)
• Von Neumann entropy penalization and low-rank matrix estimation (Q449975) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)