A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
type: Item
instance of: scholarly article
title: A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
author: Yanyan Li
published in: Journal of Scientific Computing
publication date: 2022-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7632621
zbMATH Keywords: nonsmooth
zbMATH Keywords: constrained stochastic composite optimization
zbMATH Keywords: convex
zbMATH Keywords: Nesterov's smoothing accelerated method
zbMATH Keywords: stochastic approximation
zbMATH Keywords: complexity
zbMATH Keywords: mini-batch of samples
describes a project that uses: ProxSARAH
describes a project that uses: Saga
describes a project that uses: LIBSVM
MaRDI profile type: Publication
full work available at URL: s10915-022-02016-1
OpenAlex ID: W4303411390
cites work: Smooth minimization of non-smooth functions
cites work: Q3096107
cites work: 10.1162/15324430260185628
cites work: A Stochastic Approximation Method
cites work: Acceleration of Stochastic Approximation by Averaging
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: Q3967358
cites work: Validation analysis of mirror descent stochastic approximation method
cites work: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
cites work: Stochastic proximal quasi-Newton methods for non-convex composite optimization
cites work: Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
cites work: A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
cites work: An inexact accelerated stochastic ADMM for separable convex optimization
cites work: A Proximal Stochastic Gradient Method with Progressive Variance Reduction
cites work: Inexact proximal stochastic gradient method for convex composite optimization
cites work: Katyusha: the first direct acceleration of stochastic gradient methods
cites work: Q4969178
cites work: Maximum relative margin and data-dependent regularization
cites work: Q5405177
cites work: Robust sample average approximation
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: Q4538164
cites work: A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
cites work: Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
cites work: Q3491338
cites work: Double smoothing technique for large-scale linearly constrained convex optimization
cites work: Adaptive smoothing algorithms for nonsmooth composite convex minimization
cites work: Randomized smoothing for stochastic optimization
cites work: An optimal method for stochastic composite optimization
cites work: First-Order Methods in Optimization
DOI: 10.1007/S10915-022-02016-1
description: scientific article; zbMATH DE number 7632621