Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint (2505.17382v1)

Published 23 May 2025 in math.OC

Abstract: This paper investigates the box-constrained $\ell_0$-regularized sparse optimization problem. We introduce the concept of a $\tau$-stationary point and establish its connection to the local and global minima of the box-constrained $\ell_0$-regularized sparse optimization problem. We utilize the $\tau$-stationary points to define the support set, which we divide into active and inactive components. Subsequently, the Newton's method is employed to update the non-active variables, while the proximal gradient method is utilized to update the active variables. If the Newton's method fails, we use the proximal gradient step to update all variables. Under some mild conditions, we prove the global convergence and the local quadratic convergence rate. Finally, experimental results demonstrate the efficiency of our method.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com