Group-Sparse Model Selection: Hardness and Relaxations

DOI10.1109/TIT.2016.2602222zbMath1359.94943arXiv1303.3207OpenAlexW2963201025MaRDI QIDQ2976532

Siddhartha Satpathi, Volkan Cevher, Anastasios Kyrillidis, Nirav Bhan, Luca Baldassarre

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/1303.3207

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Structured Sparsity: Discrete and Convex Approaches ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ A Single-Phase, Proximal Path-Following Framework ⋮ Optimization problems involving group sparsity terms

This page was built for publication: Group-Sparse Model Selection: Hardness and Relaxations