Structured Sparsity: Discrete and Convex Approaches
From MaRDI portal
Publication:3460840
DOI10.1007/978-3-319-16042-9_12zbMath1333.94021arXiv1507.05367OpenAlexW1037812049MaRDI QIDQ3460840
Quoc Tran Dinh, Luca Baldassarre, Marwa El Halabi, Anastasios Kyrillidis, Volkan Cevher
Publication date: 8 January 2016
Published in: Compressed Sensing and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05367
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative hard thresholding for compressed sensing
- Convex analysis and nonlinear optimization. Theory and examples.
- The benefit of group sparsity
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A faster strongly polynomial time algorithm for submodular function minimization
- The composite absolute penalties family for grouped and hierarchical variable selection
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Near best tree approximation
- Sparse group Lasso and high dimensional multinomial classification
- Realization of set functions as cut functions of graphs and hypergraphs
- On the distribution of the largest eigenvalue in principal components analysis
- Least angle regression. (With discussion)
- Learning Bayesian networks: The combination of knowledge and statistical data
- The convex geometry of linear inverse problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Matrix recipes for hard thresholding methods
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Accelerated and Inexact Forward-Backward Algorithms
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Group-Sparse Model Selection: Hardness and Relaxations
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Beyond the flow decomposition barrier
- Learning Deep Architectures for AI
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- The Group Lasso for Logistic Regression
- Strongly Regular Generalized Equations
- A generalized proximal point algorithm for certain non-convex minimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- An analysis of approximations for maximizing submodular set functions—I
- Atomic Decomposition by Basis Pursuit
- Numerical Optimization
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Sparse Reconstruction by Separable Approximation
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing
- Order-Preserving Factor Analysis—Application to Longitudinal Gene Expression
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Sparsity and Smoothness Via the Fused Lasso
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Spiking Neuron Models
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Embedded image coding using zerotrees of wavelet coefficients
- Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Principles of Optics
- Model-Based Compressive Sensing
- Excessive Gap Technique in Nonsmooth Convex Minimization
- On Model-Based RIP-1 Matrices
- Submodular Maximization with Cardinality Constraints
- Model-based Sketching and Recovery with Expanders
- Learning with Structured Sparsity
- Learning with Submodular Functions: A Convex Optimization Perspective
- Model Selection and Estimation in Regression with Grouped Variables
- Signal Recovery by Proximal Forward-Backward Splitting
- Composite Self-Concordant Minimization
- Covariance selection for nonchordal graphs via chordal embedding
- Compressed sensing
This page was built for publication: Structured Sparsity: Discrete and Convex Approaches