Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
From MaRDI portal
Publication:5064148
DOI10.1360/SSM-2020-0181zbMath1499.90151OpenAlexW3115024373MaRDI QIDQ5064148
Publication date: 21 March 2022
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1360/ssm-2020-0181
Related Items (4)
Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
This page was built for publication: Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems