An efficient algorithm for non-convex sparse optimization

DOI10.3934/JIMO.2018134zbMath1438.65129OpenAlexW2897494177WikidataQ128981279 ScholiaQ128981279MaRDI QIDQ2315622

Yong Wang, Guanglu Zhou, Wanquan Liu

Publication date: 25 July 2019

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018134

zbMATH Keywords

sparse optimizationnon-Lipschitz optimizationcompressing sensingnon-convex problem with non-negative constraintSMM method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (1)

A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing

This page was built for publication: An efficient algorithm for non-convex sparse optimization