On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
From MaRDI portal
Publication:4979860
DOI10.1137/120894464zbMath1297.90119arXiv1307.1879OpenAlexW1998880679MaRDI QIDQ4979860
Publication date: 19 June 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.1879
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints ⋮ New results on subgradient methods for strongly convex optimization problems with a unified analysis ⋮ Stochastic mirror descent method for distributed multi-agent optimization ⋮ Algorithms for stochastic optimization with function or expectation constraints ⋮ On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems ⋮ Probabilistic robustness estimates for feed-forward neural networks ⋮ Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization ⋮ A framework of convergence analysis of mini-batch stochastic projected gradient methods ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis ⋮ Stochastic approximation with discontinuous dynamics, differential inclusions, and applications ⋮ Federated learning for minimizing nonsmooth convex loss functions ⋮ Stochastic incremental mirror descent algorithms with Nesterov smoothing ⋮ On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes ⋮ Generalised gossip-based subgradient method for distributed optimisation ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures ⋮ Fastest rates for stochastic mirror descent methods ⋮ Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning ⋮ A stochastic primal-dual method for optimization with conditional value at risk constraints ⋮ A family of subgradient-based methods for convex optimization problems in a unifying framework ⋮ Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity ⋮ Exploiting problem structure in optimization under uncertainty via online convex optimization ⋮ On the Convergence of Mirror Descent beyond Stochastic Convex Programming ⋮ Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
