Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions

DOI10.1109/TIT.2016.2601599zbMath1359.94156arXiv1412.4659OpenAlexW3100632598MaRDI QIDQ2976591

No author found.

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Completely positive factorization by a Riemannian smoothing method ⋮ Seq-SVF: an unsupervised data-driven method for automatically identifying hidden governing equations ⋮ On sparse approximations of solutions to linear systems with orthogonal matrices ⋮ Performance bounds of the intensity-based estimators for noisy phase retrieval ⋮ The Capra-subdifferential of the ℓ ₀ pseudonorm ⋮ Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds ⋮ Robust data-driven discovery of governing physical laws with error bars ⋮ Unnamed Item ⋮ Finding a low-rank basis in a matrix subspace ⋮ A geometric analysis of phase retrieval ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint

This page was built for publication: Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions