We introduce a new stochastic gradient algorithm, SAAGA, and investigate its employment for solving Stochastic MPC problems and multi-stage stochastic optimization programs in general. The method is particularly attractive for scenario-based formulations that involve a large number of scenarios, for which 'batch' formulations may become inefficient due to high computational costs. Benefits of the method include cheap computations per iteration and fast convergence due to the sparsity of the proposed problem decomposition.
Stochastic gradient methods for stochastic model predictive control
Villa, Silvia;
2016-01-01
Abstract
We introduce a new stochastic gradient algorithm, SAAGA, and investigate its employment for solving Stochastic MPC problems and multi-stage stochastic optimization programs in general. The method is particularly attractive for scenario-based formulations that involve a large number of scenarios, for which 'batch' formulations may become inefficient due to high computational costs. Benefits of the method include cheap computations per iteration and fast convergence due to the sparsity of the proposed problem decomposition.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
31_SAAGA.pdf
accesso chiuso
Descrizione: Articolo principale
Tipologia:
Documento in versione editoriale
Dimensione
589.64 kB
Formato
Adobe PDF
|
589.64 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.