Pages that link to "Item:Q2655288"
From MaRDI portal
The following pages link to Exact matrix completion via convex optimization (Q2655288):
Displayed 50 items.
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← 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)
- Comment on ``Hypothesis testing by convex optimization'' (Q491382) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- A half thresholding projection algorithm for sparse solutions of LCPs (Q497459) (← links)
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
- Fast quantum algorithms for least squares regression and statistic leverage scores (Q507434) (← links)
- Finding a low-rank basis in a matrix subspace (Q517309) (← links)
- Degrees of freedom in low rank matrix estimation (Q525906) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← 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)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
- Some empirical advances in matrix completion (Q548919) (← links)
- Approximation of frame based missing data recovery (Q550489) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm (Q643650) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← 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)
- Interpreting latent variables in factor models via convex optimization (Q681494) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- On the generation of random stable polynomials (Q719189) (← links)
- Explicit frames for deterministic phase retrieval via PhaseLift (Q723007) (← links)
- Sparse functional identification of complex cells from spike times and the decoding of visual stimuli (Q723690) (← links)
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
- Reduction of nonlinear embedded boundary models for problems with evolving interfaces (Q728679) (← 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)
- Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization (Q781096) (← links)
- Rank minimization with applications to image noise removal (Q781854) (← links)
- High resolution 3D imaging in MIMO radar with sparse array (Q784570) (← links)
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery (Q820791) (← links)
- Generalized co-sparse factor regression (Q830453) (← links)
- Choice of parameters in the weighted nuclear norm method for image denoising (Q830991) (← links)
- Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
- Learning Markov random walks for robust subspace clustering and estimation (Q889299) (← links)
- A proximal alternating linearization method for minimizing the sum of two convex functions (Q892779) (← links)
- Generalized transfer subspace learning through low-rank constraint (Q903542) (← links)
- Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
- Statistical analysis of \(k\)-nearest neighbor collaborative recommendation (Q973879) (← links)