73. An Inexact Projected Regularized Newton Method for Fused Zero-norms Regularization Problems
Invited abstract in session WE-3: Structured sparse optimization, stream Variational analysis: theory and algorithms.
Wednesday, 14:10 - 15:50Room: M:J
Authors (first author is the speaker)
| 1. | Yuqia Wu
|
| School of Mathematical Sciences, Shenzhen University | |
| 2. | Shaohua Pan
|
| School of Mathematics, South China University of Technology | |
| 3. | Xiaoqi Yang
|
| Department of Applied Mathematics, The Hong Kong Polytechnic University |
Abstract
In this talk, we are concerned with structured $\ell_0$-norms regularization problems, with a twice continuously differentiable loss function and a box constraint. This class of problems have a wide range of applications in statistics, machine learning and image processing. To the best of our knowledge, there is no effective algorithm in the literature for solving them. In this work, we first obtain a polynomial-time algorithm to find a point in the proximal mapping of the fused $\ell_0$-norms with a box constraint based on dynamic programming principle. We then propose a hybrid algorithm of proximal gradient method and inexact projected regularized Newton method to solve structured $\ell_0$-norms regularization problems. The whole sequence generated by the algorithm is shown to be convergent by virtue of a non-degeneracy condition, a curvature condition and a Kurdyka-{\L}ojasiewicz property. A superlinear convergence rate of the iterates is established under a locally H\"{o}lderian error bound condition on a second-order stationary point set, without requiring the local optimality of the limit point. Finally, numerical results highlight the features of our considered model, and the superiority of our proposed algorithm.
Keywords
- Complexity and efficiency of optimization algorithms
Status: accepted
Back to the list of papers