Abstract
Stochastic optimal control problems are typically of rather large scale involving millions of decision variables, but possess a certain structure which can be exploited by first-order methods such as forward-backward splitting and the alternating direction method of multipliers (ADMM). In this paper, we use the forward-backward envelope, a real-valued continuously differentiable penalty function, to recast the dual of the original nonsmooth problem as an unconstrained problem which we solve via the limited-memory BFGS algorithm. We show that the proposed method leads to a significant improvement of the convergence rate without increasing much the computational cost per iteration.
Original language | English |
---|---|
Title of host publication | IFAC World Congress |
Pages | 11865-11870 |
Number of pages | 6 |
ISBN (Electronic) | 2405-8963 |
DOIs | |
Publication status | Published - Jul 2017 |
Event | 20th World Congress of the International Federation of Automatic Control 2017 - Toulouse, France Duration: 10 Jul 2017 → 14 Jul 2017 |
Conference
Conference | 20th World Congress of the International Federation of Automatic Control 2017 |
---|---|
Abbreviated title | IFAC 2017 |
Country/Territory | France |
City | Toulouse |
Period | 10/07/2017 → 14/07/2017 |
Keywords
- Quasi-Newtonian methods
- Convex optimization
- Large-scale optimization
- Parallelization
- Stochastic optimal control
- Stochastic Model Predictive Control
- GPGPU