Fast algorithms for structured sparsity (ICALP 2015 invited tutorial)

MaRDI QIDQ4967200zbMATH OpenFDO

Authors Chinmay Hegde, Ludwig Schmidt, Piotr Indyk

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/382/362

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Theory of data (68P99)

Recommendations

• Structured sparsity: discrete and convex approaches
• Learning with Structured Sparsity
• Regularizers for structured sparsity
• Structured sparsity through convex optimization
• Structured sparsity via alternating direction methods

Cited in

(2)

• Discrete optimization methods for group model selection in compressed sensing
• Structured sparsity: discrete and convex approaches

This page was built for publication: Fast algorithms for structured sparsity (ICALP 2015 invited tutorial)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967200)