Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems

DOI10.1007/978-3-319-97478-1_13zbMath1421.90118OpenAlexW2899994258MaRDI QIDQ2415211

Amir Beck, Dror Pan

Publication date: 21 May 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-97478-1_13

zbMATH Keywords

nonconvex programmingpolynomialsmajorization minimizationsparse source localizationcomposite model

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (2)

On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods ⋮ The regularized feasible directions method for nonconvex optimization

This page was built for publication: Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems