Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Generalization of Sampling Without Replacement From a Finite Universe
- A Singular Value Thresholding Algorithm for Matrix Completion
- Collective matrix completion
- Construction of weights in surveys: a review
- Exact matrix completion via convex optimization
- First-order methods in optimization
- Flexible low-rank statistical modeling with missing data and side information
- Fractional hot deck imputation
- Generalized high-dimensional trace regression via nuclear norm regularization
- Generalized low rank models
- Inference and missing data
- Inference for nonprobability samples
- Main effects and interactions in mixed and incomplete data frames
- Matrix Completion under Low-Rank Missing Mechanism
- Matrix completion from noisy entries
- Matrix completion under complex survey sampling
- Matrix completion with covariate information
- Max-norm optimization for robust matrix recovery
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Sampling Statistics
- Simple structure in component analysis techniques for mixtures of qualitative and quantitative variables
- Spectral regularization algorithms for learning large incomplete matrices
- Statistical analysis with missing data
- Using side information to reliably learn low-rank matrices from missing and corrupted observations
This page was built for publication: Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968271)
