Pages that link to "Item:Q5281478"

The following pages link to The Power of Convex Relaxation: Near-Optimal Matrix Completion (Q5281478):

Displaying 50 items.

• Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification (Q123602) (← 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)
• Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• Estimation of low rank density matrices: bounds in Schatten norms and other distances (Q315410) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• On tensor completion via nuclear norm minimization (Q330103) (← links)
• A graphical approach to the analysis of matrix completion (Q335673) (← links)
• Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← 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)
• Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
• High-dimensional covariance matrix estimation with missing observations (Q395991) (← links)
• Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
• Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
• Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
• Selecting the number of components in principal component analysis using cross-validation approximations (Q434968) (← links)
• Von Neumann entropy penalization and low-rank matrix estimation (Q449975) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• First-order optimality condition of basis pursuit denoise problem (Q469076) (← links)
• A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
• A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• MIMCA: multiple imputation for categorical variables with multiple correspondence analysis (Q518262) (← links)
• Degrees of freedom in low rank matrix estimation (Q525906) (← links)
• Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
• Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
• Estimation of high-dimensional low-rank matrices (Q548539) (← links)
• Optimal selection of reduced rank estimators of high-dimensional matrices (Q548562) (← links)
• Some empirical advances in matrix completion (Q548919) (← links)
• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm (Q643650) (← links)
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion (Q661157) (← links)
• A new algorithm for positive semidefinite matrix completion (Q670219) (← links)
• Max-norm optimization for robust matrix recovery (Q681486) (← links)
• Robust matrix completion (Q682808) (← links)
• An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
• Explicit frames for deterministic phase retrieval via PhaseLift (Q723007) (← links)
• Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction (Q739472) (← links)
• Learning non-parametric basis independent models from point queries via low-rank methods (Q741260) (← links)
• Rank minimization with applications to image noise removal (Q781854) (← links)
• High resolution 3D imaging in MIMO radar with sparse array (Q784570) (← links)
• Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
• Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
• Multivariate GARCH estimation via a Bregman-proximal trust-region method (Q1623522) (← links)