A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems

Recommendations

Cited in

(17)

On convergence of the stochastic subgradient method with on-line stepsize rules
On the information-adaptive variants of the ADMM: an iteration complexity perspective
An optimal method for stochastic composite optimization
Stochastic quasigradient methods for optimization of discrete event systems
String-averaging incremental stochastic subgradient algorithms
A numerical method for solving stochastic programming problems with moment constraints on a distribution function
scientific article; zbMATH DE number 4014470 (Why is no real title available?)
A method of stochastic subgradients with complete feedback stepsize rule for convex stochastic approximation problems
Mean-variance risk-averse optimal control of systems governed by PDEs with random parameter fields using quadratic approximations
A sparsity preserving stochastic gradient methods for sparse regression
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
Penalty methods with stochastic approximation for stochastic nonlinear programming
scientific article; zbMATH DE number 3987057 (Why is no real title available?)
Monotone methods with averaging of subgradients and their stochastic finite-difference analogs
Algorithms for stochastic optimization with function or expectation constraints
Differentiability of the integral over a set defined by inclusion

This page was built for publication: A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731371)