A totally unimodular view of structured sparsity

11/07/2014
by   Marwa El Halabi, et al.
0

This paper describes a simple framework for structured sparse recovery based on convex optimization. We show that many structured sparsity models can be naturally represented by linear matrix inequalities on the support of the unknown parameters, where the constraint matrix has a totally unimodular (TU) structure. For such structured models, tight convex relaxations can be obtained in polynomial time via linear programming. Our modeling framework unifies the prevalent structured sparsity norms in the literature, introduces new interesting ones, and renders their tightness and tractability arguments transparent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2019

Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization

Stochastic optimization algorithms update models with cheap per-iteratio...
research
09/12/2011

Structured sparsity through convex optimization

Sparse estimation methods are aimed at using or obtaining parsimonious r...
research
10/19/2020

Nearly sharp structured sketching for constrained optimization

In this work, we study a tensor-structured random sketching matrix to pr...
research
01/16/2012

A General Framework of Dual Certificate Analysis for Structured Sparse Recovery Problems

This paper develops a general theoretical framework to analyze structure...
research
09/05/2020

Structured Sparsity Modeling for Improved Multivariate Statistical Analysis based Fault Isolation

In order to improve the fault diagnosis capability of multivariate stati...
research
05/06/2012

Convex Relaxation for Combinatorial Penalties

In this paper, we propose an unifying view of several recently proposed ...
research
02/08/2014

An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning

From concentration inequalities for the suprema of Gaussian or Rademache...

Please sign up or login with your details

Forgot password? Click here to reset