.png){kind=icon}
返回
Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2010.05.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Efficient randomized algorithms are developed for solving robust feasibility problems with multiple parameter-dependent convex constraints. Two complementary strategies are presented, both of which exploit the multiplicity to achieve fast convergence. One is the stochastic ellipsoid method with multiple updates. In each iteration of this algorithm, an ellipsoid which describes a candidate of the solution set is updated many times via the multiple constraints with one random sample, while at most one update is allowed in the original method. The other is the stochastic ellipsoid method with multiple cuts. Here, a new update rule is presented to construct a smaller ellipsoid directly via multiple subgradients given by the constraints. A quantitative analysis of the volume of the ellipsoid is also provided, which guarantees the advantage of the proposed algorithm over the original one. The above features lead to a reduction of the total number of random samples necessary for convergence, which is extensively demonstrated through numerical examples. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Robust control
Randomized algorithms
Stochastic ellipsoid methods
Robust feasibility problems
Parameter-dependent linear matrix inequalities
Probabilistic robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏A probabilistic analytic center cutting plane method for feasibility of uncertain LMlsAUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Guaranteed cost regulator design: A probabilistic solution and a randomized algorithmAUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容