.png){kind=icon}
返回
Bounded error identification of Hammerstein systems through sparse polynomial optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2012.06.078.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a procedure for the evaluation of bounds on the parameters of Hammerstein systems, from output measurements affected by bounded errors. The identification problem is formulated in terms of polynomial optimization, and relaxation techniques, based on linear matrix inequalities, are proposed to evaluate parameter bounds by means of convex optimization. The structured sparsity of the formulated identification problem is exploited to reduce the computational complexity of the convex relaxed problem. Analysis of convergence properties and computational complexity is reported. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Bounded error identification
Hammerstein systems
Parameter bounds
Sparse LMI relaxation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏Promising Agromaterials Based on Biodegradable Polymers: Polylactide and Poly-3-Hydroxybutyrate.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏
查看更多内容