Non-convex Optimization via Strongly Convex Majorization-minimization

DOI10.4153/S0008439519000730zbMath1458.90526arXiv1906.05608WikidataQ126581695 ScholiaQ126581695MaRDI QIDQ5148071

Azita Mayeli

Publication date: 29 January 2021

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

convex function; cost function; stationary point; Moreau envelope; infimal convolution; local majorizer and minimizer; surregator

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65R32: Numerical methods for inverse problems for integral equations

Uses Software

• PDCO
• ElemStatLearn

Cites Work

• Unnamed Item
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Iteratively reweighted least squares minimization for sparse recovery
• Atomic Decomposition by Basis Pursuit
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• A General Framework for Sparsity-Based Denoising and Inversion
• <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
• Sparse Regularization via Convex Analysis
• A Brief Survey of Modern Optimization for Statisticians
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Convex analysis and monotone operator theory in Hilbert spaces
• Sparse Image and Signal Processing