Structured low-rank approximation with missing data
DOI10.1137/120883050zbMATH Open1271.93017OpenAlexW2027924293WikidataQ114615478 ScholiaQ114615478MaRDI QIDQ2848639FDOQ2848639
Konstantin Usevich, Ivan Markovsky
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120883050
missing datalow-rank approximationsystem identificationvariable projectionunconstrained minimizationregularized cost functionquadratic equality constraintsapproximate matrix completiondata-driven simulation problemsliterate programsingular linear least-norm problem
Generalized linear models (logistic models) (62J12) Matrix completion problems (15A83) Time series analysis of dynamical systems (37M10) Problems with incomplete information (optimization) (49N30) System identification (93B30) Approximation with constraints (41A29)
Cited In (24)
- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
- Greedy structure learning from data that contain systematic missing values
- Missing Data Recovery for High-Dimensional Signals With Nonlinear Low-Dimensional Structures
- Structured low-rank approximation: optimization on matrix manifold approach
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- Optimization on a Grassmann manifold with application to system identification
- Identification from data with periodically missing output samples
- The most powerful unfalsified model for data with missing values
- On the low rank solution of the Q‐weighted nearest correlation matrix problem
- Variable projection methods for approximate (greatest) common divisor computations
- A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints
- A gradient system for low rank matrix completion
- Realization and identification of autonomous linear periodically time-varying systems
- Multichannel frequency estimation with constant amplitude via convex structured low-rank approximation
- Adjacency-based regularization for partially ranked data with non-ignorable missing
- An efficient method for non-negative low-rank completion
- Modeling and identification of uncertain-input systems
- Iterative algorithm for the Q-weighted nonnegative matrix factorization
- Desingularization of Bounded-Rank Matrix Sets
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation
- Title not available (Why is that?)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
Recommendations
- Factorization Approach to Structured Low-Rank Approximation with Applications 👍 👎
- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data 👍 👎
- Software for weighted structured low-rank approximation 👍 👎
- Structured low rank approximation 👍 👎
- Low-rank approximation algorithms for matrix completion with random sampling 👍 👎
This page was built for publication: Structured low-rank approximation with missing data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848639)
