Pages that link to "Item:Q4981856"
From MaRDI portal
The following pages link to On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856):
Displayed 6 items.
- Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators (Q326400) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)