no. 15 · Monday 16 November 2026
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
Abstract
The paper proposes a novel proximal difference-of-convex (DC) algorithmic framework to solve general nonconvex, nonsmooth optimization problems. The basic pBBDCA method combines Barzilai-Borwein (BB) parameter selection with a nonmonotone directional line search, requiring only one proximal solve per iteration. We also develop two extrapolated variants using restart and safeguarding mechanisms. The global convergence of the proposed framework is rigorously established under the Kurdyka-Łojasiewicz property. Numerical experiments on the SCAD-regularized least squares problem and graph Ginzburg-Landau image segmentation models demonstrate that the proposed methods achieve highly competitive efficiency and accuracy.
- fields
- Optimization and Control, Numerical Analysis