Pages that link to "Item:Q2340166"
From MaRDI portal
The following pages link to Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems (Q2340166):
Displaying 8 items.
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- Variable smoothing for weakly convex composite functions (Q2031930) (← links)
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)