Some advances in theory and algorithms for sparse optimization

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.04.001MaRDI QIDQ4986066zbMATH OpenFDO

Authors Chen Zhao, Ziyan Luo, Naihua Xiu

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.04.001

zbMATH Keywords

sparse optimizationgroup sparsitysparse set\({\ell_0}\) norm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Preface
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
• Stability analysis of a class of sparse optimization problems
• Sparse Optimization with Least-Squares Constraints

Cited in

(9)

• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion
• Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
• MOEA/D with chain-based random local search for sparse optimization
• Neural network for a class of sparse optimization with L₀-regularization
• Relaxation approaches for nonlinear sparse optimization problems
• Preface
• Did you say parsimony
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation

This page was built for publication: Some advances in theory and algorithms for sparse optimization

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