Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm

DOI10.3934/ipi.2015.9.1093zbMath1332.65062arXiv1405.5908OpenAlexW2963047269MaRDI QIDQ256102

Michael Moeller, Martin Burger, Pia Heins

Publication date: 9 March 2016

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5908

zbMATH Keywords

inverse problemsvariational methodscompressed sensing\(\ell^{1\infty}\)-regularizationlocal sparsitymixed norms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Computing methodologies for image processing (68U10) Inverse problems in optimal control (49N45)

Related Items (3)

ORKA: Object reconstruction using a K-approximation graph ⋮ Collaborative Total Variation: A General Framework for Vectorial TV Models ⋮ Modern regularization methods for inverse problems

Cites Work

• 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
• Regularization methods in Banach spaces.
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Sparse regression using mixed norms
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Characterization of the subdifferential of some matrix norms
• Application of the alternating direction method of multipliers to separable convex programming problems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A proximal-based deomposition method for compositions method for convex minimization problems
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• An affine scaling methodology for best basis selection
• Optimization with Sparsity-Inducing Penalties
• Robust principal component analysis?
• Compressed sensing and best 𝑘-term approximation
• On Sparse Representations in Arbitrary Redundant Bases
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Just relax: convex programming methods for identifying sparse signals in noise
• Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Uncertainty principles and ideal atomic decomposition
• Regression Shrinkage and Selection via The Lasso: A Retrospective
• Convergence rates of convex variational regularization
• Robust Matrix Decomposition With Sparse Corruptions
• A Probabilistic and RIPless Theory of Compressed Sensing
• Sparse solutions to linear inverse problems with multiple measurement vectors
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting
• Model Selection and Estimation in Regression with Grouped Variables
• Decomposition method with a variable parameter for a class of monotone variational inequality problems
• Structured sparsity through convex optimization

This page was built for publication: Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm