Some primal-dual theory for subgradient methods for strongly convex optimization
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A simple nearly optimal restart scheme for speeding up first-order methods
- Accelerated dual-averaging primal–dual method for composite convex minimization
- Algorithms for stochastic optimization with function or expectation constraints
- Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems
- Convergence of first-order methods via the convex conjugate
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
- Convergence rates of proximal gradient methods via the convex conjugate
- Faster subgradient methods for functions with Hölderian growth
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Incremental subgradient methods for nondifferentiable optimization
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- On modification of an adaptive stochastic mirror descent algorithm for convex optimization problems with functional constraints
- Perturbed Fenchel duality and first-order methods
- Primal convergence from dual subgradient methods for convex optimization
- Primal-dual subgradient methods for convex problems
- Radial subgradient method
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- The approximate duality gap technique: a unified theory of first-order methods
- Variational Analysis
This page was built for publication: Some primal-dual theory for subgradient methods for strongly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885408)
