Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm

DOI10.1016/j.neunet.2019.06.015zbMath1434.68411OpenAlexW2954099021WikidataQ92383274 ScholiaQ92383274MaRDI QIDQ2185635

Bin Gu, Xiang Li, Xiang Geng, Guan-Sheng Zheng

Publication date: 5 June 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2019.06.015

zbMATH Keywords

overlapping groupsinexact proximal operator\(l_1/l_\infty\) normstructured-sparsity regularization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• glasso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse inverse covariance estimation with the graphical lasso
• The Adaptive Lasso and Its Oracle Properties
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Proximal methods for the latent group lasso penalty
• Accelerated and Inexact Forward-Backward Algorithms
• Optimization with Sparsity-Inducing Penalties
• Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity

This page was built for publication: Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm