Run-to-run convergence analysis of model-based policy iteration algorithms for experimental optimization of batch processes
Convergence analysis of iterative identification-optimization schemes is a key issue in modeling for optimization of batch processes. In this work, it is formally shown that for convergence is sufficient to guarantee that parametric uncertainty is increasingly reduced on a run-to-run basis. Converge...
Saved in:
Published in | Computer Aided Chemical Engineering Vol. 28; pp. 925 - 930 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
2010
|
Subjects | |
Online Access | Get full text |
ISBN | 9780444535696 0444535691 |
ISSN | 1570-7946 |
DOI | 10.1016/S1570-7946(10)28155-5 |
Cover
Loading…
Summary: | Convergence analysis of iterative identification-optimization schemes is a key issue in modeling for optimization of batch processes. In this work, it is formally shown that for convergence is sufficient to guarantee that parametric uncertainty is increasingly reduced on a run-to-run basis. Convergence of a policy iteration algorithm to an optimal policy which satisfies the Hamilton-Jacobi-Bellman equation is thus assured as long as parametric uncertainty is iteratively reduced such that the performance prediction mismatch is driven to zero. The integration of global sensivity analysis with confidence interval boostrapping in the design of a convergent algorithm for model-based policy iteration is proposed. A simple bioprocess is used to exemplify run-to-run improvement. |
---|---|
ISBN: | 9780444535696 0444535691 |
ISSN: | 1570-7946 |
DOI: | 10.1016/S1570-7946(10)28155-5 |