.png){kind=icon}
返回
Semidefinite programming duality and linear time-invariant systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2002.806652.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several important problems in control theory can be reformulated as semidefinite programming problems, i.e., minimization of a linear objective subject to linear matrix inequality (LMI) constraints. From convex optimization duality theory, conditions for infeasibility of the LMIs, as well as dual optimization problems, can be formulated. These can in turn be reinterpreted in control or system theoretic terms, often yielding new results or new proofs for existing results from control theory. We explore such connections for a few problems associated with linear time-invariant systems.
Keyword:
convex duality
linear matrix inequality (LMI)
linear time-invariant (LTI) systems
semidefinite programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
引用论文
Track deflection and stiffness measurements from a track recording car.png)
Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit
Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid TransitIF0
PREAI
分享收藏Characteristics of mutations at the D5S818 locus studied with a tightly linked markerTransfusion
TransfusionIF0
PREAI
分享收藏
查看更多内容