Pages that link to "Item:Q5281038"
From MaRDI portal
The following pages link to Recovering Low-Rank Matrices From Few Coefficients in Any Basis (Q5281038):
Displayed 50 items.
- Local asymptotic equivalence of pure states ensembles and quantum Gaussian white noise (Q1990598) (← links)
- On polynomial time methods for exact low-rank tensor completion (Q2007852) (← links)
- Matrix factorization for multivariate time series analysis (Q2008611) (← links)
- Low-rank matrix completion in a general non-orthogonal basis (Q2032243) (← links)
- Phase retrieval with PhaseLift algorithm (Q2033498) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Matrix optimization based Euclidean embedding with outliers (Q2044470) (← links)
- Tensor theta norms and low rank recovery (Q2048814) (← links)
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- An adaptation for iterative structured matrix completion (Q2072669) (← links)
- An \({\ell_p}\) theory of PCA and spectral clustering (Q2091846) (← links)
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion (Q2095166) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Tight risk bound for high dimensional time series completion (Q2137821) (← links)
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
- Quantum tomography by regularized linear regressions (Q2174032) (← links)
- Complex best \(r\)-term approximations almost always exist in finite dimensions (Q2175019) (← links)
- Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
- Enhanced image approximation using shifted rank-1 reconstruction (Q2176516) (← links)
- An alternating minimization method for matrix completion problems (Q2182816) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- On the spectra of general random mixed graphs (Q2223454) (← links)
- Convergence of projected Landweber iteration for matrix rank minimization (Q2252213) (← links)
- Fixed-rank matrix factorizations and Riemannian low-rank optimization (Q2259741) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Superresolution 2D DOA estimation for a rectangular array via reweighted decoupled atomic norm minimization (Q2298700) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements (Q2311914) (← links)
- Structured matrix estimation and completion (Q2325396) (← links)
- Nonparametric estimation of low rank matrix valued function (Q2326073) (← links)
- Stable als approximation in the TT-format for rank-adaptive tensor completion (Q2334620) (← links)
- On the nuclear norm heuristic for a Hankel matrix completion problem (Q2342541) (← links)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
- Low rank tensor recovery via iterative hard thresholding (Q2400255) (← links)
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm (Q2416614) (← links)
- Noncommutative Bennett and Rosenthal inequalities (Q2434917) (← links)
- RIPless compressed sensing from anisotropic measurements (Q2437334) (← links)
- Asymptotic equivalence of quantum state tomography and noisy matrix completion (Q2438759) (← links)
- Noisy low-rank matrix completion with general sampling distribution (Q2444669) (← links)
- Matrix concentration inequalities via the method of exchangeable pairs (Q2450243) (← links)
- An introduction to a class of matrix cone programming (Q2452376) (← links)
- Collaborative filtering with information-rich and~information-sparse entities (Q2512903) (← links)
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery (Q2515314) (← links)
- Phase retrieval from coded diffraction patterns (Q2517409) (← links)