Pages that link to "Item:Q5495837"
From MaRDI portal
The following pages link to Low-rank matrix completion using alternating minimization (Q5495837):
Displaying 50 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- Sparse functional identification of complex cells from spike times and the decoding of visual stimuli (Q723690) (← links)
- Reduction of nonlinear embedded boundary models for problems with evolving interfaces (Q728679) (← links)
- Matrix completion discriminant analysis (Q1663150) (← links)
- A gradual rank increasing process for matrix completion (Q1689449) (← links)
- Adaptive confidence sets for matrix completion (Q1708972) (← links)
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- Matrix completion under interval uncertainty (Q1752160) (← links)
- A geometric analysis of phase retrieval (Q1785008) (← links)
- Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
- Fast rank-one alternating minimization algorithm for phase retrieval (Q2000029) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm (Q2009379) (← links)
- Riemannian gradient descent methods for graph-regularized matrix completion (Q2029849) (← links)
- A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds (Q2031967) (← links)
- Quartic first-order methods for low-rank minimization (Q2031993) (← links)
- Ranking recovery from limited pairwise comparisons using low-rank matrix completion (Q2036498) (← links)
- Inductive matrix completion with feature selection (Q2038483) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
- Community detection with dependent connectivity (Q2054505) (← links)
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
- DANTE: deep alternations for training neural networks (Q2057720) (← links)
- A new method based on the manifold-alternative approximating for low-rank matrix completion (Q2061479) (← links)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion (Q2067806) (← links)
- Toeplitz matrix completion via a low-rank approximation algorithm (Q2069350) (← links)
- An adaptation for iterative structured matrix completion (Q2072669) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Heteroskedastic PCA: algorithm, optimality, and applications (Q2119219) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- Multi-target prediction for dummies using two-branch neural networks (Q2127254) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Enhanced alternating energy minimization methods for stochastic Galerkin matrix equations (Q2162725) (← links)
- Matrix completion methods for the total electron content video reconstruction (Q2170384) (← links)
- Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
- Enhanced image approximation using shifted rank-1 reconstruction (Q2176516) (← links)
- Optimal prediction in the linearly transformed spiked model (Q2176630) (← links)
- A divide-and-conquer algorithm for binary matrix completion (Q2187387) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Weighted nuclear norm minimization and its applications to low level vision (Q2193874) (← 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)
- Characterization of sampling patterns for low-tt-rank tensor retrieval (Q2202522) (← links)
- Accelerated low rank matrix approximate algorithms for matrix completion (Q2203735) (← links)
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
