Structured sparsity through convex optimization (Q5965303)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6548998

Language	Label	Description	Also known as
English	Structured sparsity through convex optimization	scientific article; zbMATH DE number 6548998

Statements

scholarly article

0 references

Structured sparsity through convex optimization (English)

0 references

zbMATH Open document ID

0 references

10.1214/12-STS394

0 references

0 references

Rodolphe Jenatton

0 references

0 references

Guillaume Obozinski

0 references

Statistical Science

0 references

publication date

3 March 2016

0 references

full work available at URL

https://arxiv.org/abs/1109.2397

0 references

https://projecteuclid.org/euclid.ss/1356098550

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

sparsity

0 references

convex optimization

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

0 references

0 references

Learning with Submodular Functions: A Convex Optimization Perspective

0 references

Optimization with Sparsity-Inducing Penalties

0 references

Model-Based Compressive Sensing

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies

0 references

10.1162/jmlr.2003.3.4-5.993

0 references

Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR

0 references

Convex analysis and nonlinear optimization. Theory and examples.

0 references

0 references

Decoding by Linear Programming

0 references

Atomic Decomposition by Basis Pursuit

0 references

Smoothing proximal gradient method for general structured sparse regression

0 references

Proximal Splitting Methods in Signal Processing

0 references

0 references

Adapting to Unknown Smoothness via Wavelet Shrinkage

0 references

Least angle regression. (With discussion)

0 references

Pathwise coordinate optimization

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

The benefit of group sparsity

0 references

Learning with Structured Sparsity

0 references

0 references

Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity

0 references

0 references

Some results on Tchebycheffian spline functions and stochastic processes

0 references

THE NATURE OF POWER CORRECTIONS IN LARGE-β<sub>0</sub> APPROXIMATION

0 references

Component selection and smoothing in multivariate nonparametric regression

0 references

Oracle inequalities and optimal inference under group sparsity

0 references

0 references

0 references

0 references

High-dimensional graphs and variable selection with the Lasso

0 references

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Support union recovery in high-dimensional multivariate regression

0 references

Theoretical properties of the overlapping groups Lasso

0 references

Nonlinear total variation based noise removal algorithms

0 references

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

0 references

0 references

Grouping Pursuit Through a Regularization Solution Surface

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Just relax: convex programming methods for identifying sparse signals in noise

0 references

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

Sparse Reconstruction by Separable Approximation

0 references

Coordinate descent algorithms for lasso penalized regression

0 references

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

0 references

Some sharp performance bounds for least squares regression with \(L_1\) regularization

0 references

The composite absolute penalties family for grouped and hierarchical variable selection

0 references

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5965303

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5965303&oldid=36231907"