Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
From MaRDI portal
Recommendations
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- scientific article; zbMATH DE number 7753349
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
Cited in
(22)- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- An accelerated directional derivative method for smooth stochastic convex optimization
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- A fast continuous time approach with time scaling for nonsmooth convex optimization
- Finite-sum smooth optimization with SARAH
- A variable smoothing algorithm for solving convex optimization problems
- Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- On accelerated proximal gradient algorithms with parameters in extrapolation coefficients
- A constrained H∞ smooth optimization technique
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Faster p-norm minimizing flows, via smoothed q-norm problems
- 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
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
- General inertial smoothing Bregman proximal gradient algorithms for group capped-_1 regularized minimization
This page was built for publication: Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064148)
