JSIAM Letters
Online ISSN : 1883-0617
Print ISSN : 1883-0609
ISSN-L : 1883-0617
DC-type gradient mapping and semismooth Newton method for sparse DC optimization problems
Shummin Nakayama
Author information
JOURNAL FREE ACCESS

2026 Volume 18 Pages 121-124

Details
Abstract

We consider sparse optimization problems in which the objective is the sum of a smooth function and a possibly nonsmooth regularizer. In particular, we focus on the case where the regularizer is represented as a difference of convex (DC) function. To characterize critical points, we propose a DC-type gradient mapping, which generalizes the standard gradient mapping used in convex composite optimization. We reformulate the criticality condition as a nonlinear system and develop a semismooth Newton method for solving it. Numerical results demonstrate fast local convergence and, in particular, indicate quadratic convergence of the proposed method.

Content from these authors
© 2026 The Japan Society for Industrial and Applied Mathematics
Previous article
feedback
Top