.png){kind=icon}
返回
A randomized approximation algorithm for the minimal-norm static-output-feedback problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2015.10.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new randomized algorithm is suggested, for extracting static-output-stabilizing-feedbacks, with approximately minimal-norm, for LTI systems. The algorithm has two similar stages, where in the first one the feasibility problem is solved, and in the second one the optimization problem is solved. The formulation is unified for the feasibility and for the optimization problems, as well as for continuous-time or discrete-time systems. The method is demonstrated by applying it to the hard (conjectured to be NP-hard) problem of the minimal-gain static-output-stabilizing-feedback, and to the hard (conjectured to be NP-hard) problem of regional pole-placement via static-output-feedback in non-convex or unconnected regions. A proof of convergence (in probability) that captures the two rounds of the algorithm is given, and complexity analysis is provided, under some mild assumptions. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Linear systems
State-space representation
Feedback-stability
Static output feedbacks
Pole-placement
Approximation algorithms
Randomized algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
暂无机构信息
.png){kind=icon}
查看更多内容