Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Convex Optimization Beyond Differentiability

Fan Wu () and Wei Bian ()
Additional contact information
Fan Wu: Harbin Institute of Technology
Wei Bian: Harbin Institute of Technology

Journal of Optimization Theory and Applications, 2023, vol. 197, issue 2, No 6, 539-572

Abstract: Abstract We propose a smoothing accelerated proximal gradient (SAPG) method with fast convergence rate for finding a minimizer of a decomposable nonsmooth convex function over a closed convex set. The proposed algorithm combines the smoothing method with the proximal gradient algorithm with extrapolation $$\frac{k-1}{k+\alpha -1}$$ k - 1 k + α - 1 and $$\alpha > 3$$ α > 3 . The updating rule of smoothing parameter $$\mu _k$$ μ k is a smart scheme and guarantees the global convergence rate of $$o(\ln ^{\sigma }k/k)$$ o ( ln σ k / k ) with $$\sigma \in (\frac{1}{2},1]$$ σ ∈ ( 1 2 , 1 ] on the objective function values. Moreover, we prove that the iterates sequence is convergent to an optimal solution of the problem. We then introduce an error term in the SAPG algorithm to get the inexact smoothing accelerated proximal gradient algorithm. And we obtain the same convergence results as the SAPG algorithm under the summability condition on the errors. Finally, numerical experiments show the effectiveness and efficiency of the proposed algorithm.

Keywords: Nonsmooth optimization; Smoothing method; Accelerated algorithm with extrapolation; Convergence rate; Sequential convergence; 49J52; 65K05; 90C25; 90C30 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-023-02176-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:197:y:2023:i:2:d:10.1007_s10957-023-02176-6

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-023-02176-6

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().