Abstract In this paper, we consider a broad class of nonconvex and nonsmooth optimization problems, where one objective component is a nonsmooth weakly convex function composed with a linear operator. By integrating variable smoothing techniques with first-order methods, we propose a variable smoothing alternating proximal gradient algorithm that features flexible parameter choices for step sizes and smoothing levels. Under mild assumptions, we establish that the iteration complexity to reach an ε -approximate stationary point is O (^-3) O (ε - 3). The proposed algorithm is evaluated on sparse signal recovery and image denoising problems. Numerical experiments demonstrate its effectiveness and superiority over existing algorithms.
Long et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: