Pages that link to "Item:Q1946618"
From MaRDI portal
The following pages link to A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618):
Displaying 12 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)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Proximal primal-dual best approximation algorithm with memory (Q1756584) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- A Lagrange duality approach for multi-composed optimization problems (Q2408520) (← links)
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
