Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems
From MaRDI portal
Publication:6180307
Abstract: Scenario-based stochastic optimal control problems suffer from the curse of dimensionality as they can easily grow to six and seven figure sizes. First-order methods are suitable as they can deal with such large-scale problems, but may fail to achieve accurate solutions within a reasonable number of iterations. To achieve solutions of higher accuracy and high speed, in this paper we propose two proximal quasi-Newtonian limited-memory algorithms - MinFBE applied to the dual problem and the Newton-type alternating minimization algorithm (NAMA) - which can be massively parallelized on lockstep hardware such as graphics processing units (GPUs). We demonstrate the performance of these methods, in terms of convergence speed and parallelizability, on large-scale problems involving millions of variables.
Recommendations
- Algorithms for optimal control of stochastic switching systems
- Proximal point algorithm for an approximated stochastic optimal control problem
- Parallel asynchronous algorithms for optimal control of large-scale dynamic systems
- Partitioned Dynamic Programming for Optimal Control
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
Cites work
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A dual Newton strategy for tree-sparse quadratic programs and its implementation in the open-source software treeQP
- A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Analysis of stochastic dual dynamic programming method
- Benders decomposition for multi-stage stochastic mixed complementarity problems -- applied to a global natural gas market model
- Conjugation and second-order properties of convex functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Embedded Online Optimization for Model Predictive Control at Megahertz Rates
- Field programmable gate array based predictive control system for spacecraft rendezvous in elliptical orbits
- Fitting jump models
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Metric selection in fast dual forward-backward splitting
- Model predictive control for drift counteraction of stochastic constrained linear systems
- Newton-type Alternating Minimization Algorithm for Convex Optimization
- On Stability and Performance of Stochastic Predictive Control Techniques
- On the convergence of the forward-backward splitting method with linesearches
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Proximal splitting methods in signal processing
- Real-time model predictive control based on dual gradient projection: theory and fixed-point FPGA implementation
- Risk-averse model predictive control
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Stochastic model predictive control for constrained discrete-time Markovian switching systems
- Stochastic optimization models in forest planning: a progressive hedging solution approach
- Stochastic variational inequalities: single-stage to multistage
- Variational Analysis
This page was built for publication: Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180307)
