Name
Abstract | ||
|---|---|---|
This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a function or expectation constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), to handle problems with the constraint on devision variables. We show that this algorithm exhibits the optimal $${{{\mathcal {O}}}}(1/\epsilon ^2)$$ rate of convergence, in terms of both optimality gap and constraint violation, when the objective and constraint functions are generally convex, where $$\epsilon$$ denotes the optimality gap and infeasibility. Moreover, we show that this rate of convergence can be improved to $${{{\mathcal {O}}}}(1/\epsilon )$$ if the objective and constraint functions are strongly convex. We then present a variant of CSA, namely the cooperative stochastic parameter approximation (CSPA) algorithm, to deal with the situation when the constraint is defined over problem parameters and show that it exhibits similar optimal rate of convergence to CSA. It is worth noting that CSA and CSPA are primal methods which do not require the iterations on the dual space and/or the estimation on the size of the dual variables. To the best of our knowledge, this is the first time that such optimal SA methods for solving function or expectation constrained stochastic optimization are presented in the literature. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10589-020-00179-x | Computational Optimization and Applications |
Keywords | DocType | Volume |
Convex programming, Stochastic optimization, Complexity, Subgradient method, 90C25, 90C06, 90C22, 49M37 | Journal | 76 |
Issue | ISSN | Citations |
2 | 0926-6003 | 3 |
PageRank | References | Authors |
0.42 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guanghui Lan | 1 | 1212 | 66.26 |
| Zhiqiang Zhou | 2 | 79 | 11.05 |