首页> 美国政府科技报告 >Algorithm for Super-Optimal H Sup Inf Design: The 2-Block Case
【24h】

Algorithm for Super-Optimal H Sup Inf Design: The 2-Block Case

机译:超优化H sup Inf设计算法:2块情形

获取原文

摘要

The strengthened H sup inf optimization problem in the 2-block case is considered. An algorithm for the super-optimal solution is proposed. It is based on results by Gu, Tsai, and Postlethwaite (1987) for the less practical 1-block case. It uses state-space models and is numerically implementable. A feature of the procedure is an optimality criterion which is a natural generalization of that used in the iterative scheme of Doyle (1984) for the unstrengthened problem.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号