Algorithms for stochastic optimization with function or expectation constraints
Top Cited Papers
- 18 February 2020
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 76 (2) , 461-498
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (1637474)
This publication has 29 references indexed in Scilit:
- Validation analysis of mirror descent stochastic approximation methodMathematical Programming, 2011
- An optimal method for stochastic composite optimizationMathematical Programming, 2011
- The CoMirror algorithm for solving nonsmooth constrained convex problemsOperations Research Letters, 2010
- Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programmingMathematical Programming, 2009
- Sample average approximation of expected value constrained stochastic programsOperations Research Letters, 2008
- Acceleration of Stochastic Approximation by AveragingSIAM Journal on Control and Optimization, 1992
- A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems1986
- stochastic quasigradient methods and their application to system optimization†Stochastics, 1983
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951