Variable smoothing algorithm for inner-loop-free DC composite optimizations (2503.13990v1)

Abstract: We propose a variable smoothing algorithm for minimizing a nonsmooth and nonconvex cost function. The cost function is the sum of a smooth function and a composition of a difference-of-convex (DC) function with a smooth mapping. At each step of our algorithm, we generate a smooth surrogate function by using the Moreau envelope of each weakly convex function in the DC function, and then perform the gradient descent update of the surrogate function. The proposed algorithm does not require any inner loop unlike many existing algorithms for DC problem. We also present a convergence analysis in terms of a DC critical point for the proposed algorithm as well as its application to robust phase retrieval.