Local convergence of an algorithm for subspace identification from partial data

DOI10.1007/s10208-014-9227-7zbMath1327.90392arXiv1306.3391OpenAlexW1987142714MaRDI QIDQ887156

Laura Balzano, Stephen J. Wright

Publication date: 28 October 2015

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3391

zbMATH Keywords

optimizationsubspace identificationincomplete data

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20) Methods of reduced gradient type (90C52)

Related Items (4)

Streaming Principal Component Analysis From Incomplete Data ⋮ A Grassmann manifold handbook: basic geometry and computational aspects ⋮ Geometric Subspace Updates with Applications to Online Adaptive Nonlinear Model Reduction ⋮ A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Sparsity and incoherence in compressive sampling
• A Simpler Approach to Matrix Completion

This page was built for publication: Local convergence of an algorithm for subspace identification from partial data