A Smoothing SQP Framework for a Class of Composite L_q Minimization over Polyhedron

2014/07/27 by Ya‐Feng Liu, Shiqian Ma, Liu, Ya-Feng +5
Computer Science · Engineering · Mathematics · #90C26 and 90C30 and 90C46 and 65K05 #Advanced Optimization Algorithms Research #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Control (math.OC) #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.1407.7205

openalex publication_date 2014/07/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The composite L_q~(0

Citations

• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Iteratively reweighted least squares minimization for sparse recovery
• Smooth minimization of non-smooth functions

Related

• Smoothing technique for nonsmooth composite minimization with linear operator
• A proximal MM method for the zero-norm regularized PLQ composite optimization problem
• A regularized Newton method for ℓ_q-norm composite optimization problems
• Every critical point of an L0 composite minimization problem is a local minimizer
• A proximal method for composite minimization