.png){kind=icon}
返回
Robust semidefinite programming problems with general nonlinear parameter dependence: Approaches using the DC-representations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2012.06.090.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two conservative approaches are proposed to a semidefinite programming problem nonlinearly dependent on uncertain parameters. These approaches are applicable to general nonlinear parameter dependence not necessarily polynomial or rational. They are based on the mild assumption that the parameter dependence is expressed as the difference of two convex functions. The first approach uses constant bounds on the parameter dependence. Optimization of the bounds is reduced to convex nonsmooth minimization. The second approach uses parameter-dependent bounds for a less conservative result. Optimization of the bounds is immediate when the centroid is computable for the parameter set. Numerical examples are presented for illustration of the approaches. (c) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Robust semidefinite programming
Nonlinear parameter dependence
DC-representation
Convexity
Centroid
Linear matrix inequalities
Conservatism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏分享收藏Stability and stabilization of aperiodic sampled-data control systems using robust linear matrix inequalities.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏An Asymptotically Exact Approach to Robust Semidefinite Programming Problems with Function Variables
PREAI
分享收藏
Set-Valued Interpolative Hardy–Rogers and Set-Valued Reich–Rus–Ćirić-Type Contractions in b-Metric SpacesMathematics
OAAI
MathematicsIF0
OAAI分享收藏
查看更多内容