A Wolfe-Type Spectral Conjugate Gradient Method for Nonsmooth Convex Optimization Problems
This paper proposes a Wolfe-type spectral conjugate gradient method for nonsmooth convex optimization, built on the Moreau-Yosida regularization of the objective function. The method combines a safeguarded spectral parameter with a Dai-Kou-type conjugate parameter, and uses a Wolfe-type line search compatible with the inexact gradients that the regularization produces. We establish global convergence of the method, together with an R-linear convergence rate under an additional strong-convexity assumption. The method is evaluated on standard nonsmooth optimization benchmarks and on large-scale problems, and compared against several existing conjugate gradient and bundle-type methods. The results show that the proposed method performs competitively overall, matching or outperforming existing methods on most problems tested, while a few specific limitations of the current implementation are also identified and discussed