Pages that link to "Item:Q2343070"
From MaRDI portal
The following pages link to A variable smoothing algorithm for solving convex optimization problems (Q2343070):
Displaying 11 items.
- Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators (Q326400) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Variable smoothing for weakly convex composite functions (Q2031930) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds (Q6116240) (← links)
- Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator (Q6126596) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)