A penalty-based PALM algorithm solves a group-ℓ0 regularized LQ problem and converges to a critical point under explicit parameter conditions.
KL property of exponent $1/2$ of quadratic functions under nonnegative zero-norm constraints and applications
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper focuses on the quadratic optimization over two classes of nonnegative zero-norm constraints: nonnegative zero-norm sphere constraint and zero-norm simplex constraint, which have important applications in nonnegative sparse eigenvalue problems and sparse portfolio problems, respectively. We establish the KL property of exponent 1/2 for the extended-valued objective function of these nonconvex and nonsmooth optimization problems, and use this crucial property to develop a globally and linearly convergent projection gradient descent (PGD) method. Numerical results are included for nonegative sparse principal component analysis and sparse portfolio problems with synthetic and real data to confirm the theoretical results.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach
A penalty-based PALM algorithm solves a group-ℓ0 regularized LQ problem and converges to a critical point under explicit parameter conditions.