Pages that link to "Item:Q2655288"
From MaRDI portal
The following pages link to Exact matrix completion via convex optimization (Q2655288):
Displaying 11 items.
- Matrix completion discriminant analysis (Q1663150) (← links)
- Dealing with missing information in data envelopment analysis by means of low-rank matrix completion (Q2178379) (← links)
- Manifold regularized matrix completion for multi-label learning with ADMM (Q2179809) (← links)
- Unsupervised robust discriminative manifold embedding with self-expressiveness (Q2183573) (← links)
- Recovering low-rank and sparse matrix based on the truncated nuclear norm (Q2281698) (← links)
- Pairwise constraint propagation via low-rank matrix recovery (Q2288124) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- Large dimensional latent factor modeling with missing observations and applications to causal inference (Q2688665) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Large Margin Low Rank Tensor Analysis (Q5378344) (← links)
