Stochastic First-Order Methods with Random Constraint Projection
We consider convex optimization problems with structures that are suitable for sequential treatment or online sampling. In particular, we focus on problems where the objective function is an expected value, and the constraint set is the intersection of a large number of simpler sets. We propose an a...
Main Authors: | Wang, Mengdi, Bertsekas, Dimitri P. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics (SIAM)
2016
|
Online Access: | http://hdl.handle.net/1721.1/103776 https://orcid.org/0000-0001-6909-7208 |
Similar Items
6.231 Dynamic Programming and Stochastic Control, Fall 2008
by: Bertsekas, Dimitri
Published: (2008)
by: Bertsekas, Dimitri
Published: (2008)
Similar Items
-
Incremental constraint projection methods for variational inequalities
by: Wang, Mengdi, et al.
Published: (2015) -
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems
by: Wang, Mengdi, et al.
Published: (2015) -
6.231 Dynamic Programming and Stochastic Control, Fall 2002
by: Bertsekas, Dimitri P.
Published: (2002) -
Stochastic ordering constraint for ordered extremes
by: Adam, Mohd Bakri
Published: (2017) -
6.231 Dynamic Programming and Stochastic Control, Fall 2008
by: Bertsekas, Dimitri
Published: (2008)