Operator splitting methods in compressive sensing and sparse approximation

DOI10.1007/978-3-319-41589-5_9MaRDI QIDQ5350481zbMATH OpenOpenAlexFDO

Authors Tom Goldstein, Xiaoqun Zhang

Publication date 1 September 2017

Published in Splitting Methods in Communication, Imaging, Science, and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41589-5_9

zbMATH Keywords

algorithmalternating direction methodcompressive sensingconvex minimizationproximal operatorsplitting methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Nonconvex sparse regularization and splitting algorithms
• Proximal splitting methods in signal processing
• Introduction
• Fast L1-L2 minimization via a proximal operator
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing

Cited in

(7)

• A closer look at consistent operator splitting and its extensions for topology optimization
• A Douglas-Rachford method for sparse extreme learning machine
• Alternating direction method of multiplier for the unilateral contact problem with an automatic penalty parameter selection
• scientific article; zbMATH DE number 17433 (Why is no real title available?)
• Sparse Compression of Expected Solution Operators
• Nonconvex sparse regularization and splitting algorithms
• Compressed data separation via unconstrained l1-split analysis

This page was built for publication: Operator splitting methods in compressive sensing and sparse approximation

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