.png){kind=icon}
返回
Modifier-Adaptation Methodology for Real-Time Optimization Reformulated as a Nested Optimization Problem
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.5b01946.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The following work presents a reformulation of the modifier-adaptation methodology for real-time optimization as a nested optimization problem. Using the idea of iteration over the modifiers, this method makes it possible to find a point that satisfies the necessary conditions of optimality (NCO) of the process, despite modeling mismatch, using an outer optimization layer that updates the gradient modifiers with the objective of minimizing the Lagrangian function estimation of the process. Moreover, if a direct search algorithm is implemented in this layer, we can find the optimum without explicitly computing the gradients of the process. The presented scheme was tested in three optimization examples, assuming the absence and presence of process noise, with parametric and structural uncertainty. The results show that in all the cases studied, the method converges to a close neighborhood of a point that satisfies the NCO of the real plant, being robust under noisy scenarios and without the need to estimate process derivatives.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
引用论文
Energy storage performance in BiMnO3-modified AgNbO3 anti-ferroelectric ceramicsBiMnO3-modified AgNbO3反铁电陶瓷的储能性能
PREAI
分享收藏
分享收藏Adaptive extremum seeking control of nonlinear dynamic systems with parametric uncertainties具有参数不确定性的非线性动态系统的自适应极值搜索控制.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏Optimization by direct search: New perspectives on some classical and modern methodsSIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAI分享收藏
查看更多内容