Proximal Mapping for Symmetric Penalty and Sparsity

DOI10.1137/17M1116544zbMath1390.90438MaRDI QIDQ4606656

Nadav Hallak, Amir Beck

Publication date: 9 March 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

optimality conditions; proximal gradient; symmetric sets; nonconvex proximal operator; sparse regularizer

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms, Fundamental Domains for Symmetric Optimization: Construction and Search, Minimizers of sparsity regularized Huber loss function, Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization, Orbital geometry and group majorisation in optimisation, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Optimization problems involving group sparsity terms, Newton method for \(\ell_0\)-regularized optimization

Uses Software

• PDCO
• GESPAR

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The sparse principal component analysis problem: optimality conditions and algorithms
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Iterative thresholding for sparse approximations
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
• Introduction to Nonlinear Optimization
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• Decoding by Linear Programming
• Just relax: convex programming methods for identifying sparse signals in noise
• Sparse and Redundant Representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Atomic Decomposition by Basis Pursuit
• Structured Compressed Sensing: From Theory to Applications
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• Sparse Approximate Solutions to Linear Systems
• Convex Analysis on the Hermitian Matrices
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• Sparse Approximation via Penalty Decomposition Methods
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressed sensing