...
首页> 外文期刊>Intelligent automation and soft computing >NEW ALGORITHM FOR COMPLEX OPTIMIZATION PROBLEM WITH INEQUALITY CONSTRAINTS
【24h】

NEW ALGORITHM FOR COMPLEX OPTIMIZATION PROBLEM WITH INEQUALITY CONSTRAINTS

机译:具有不等式约束的复杂优化问题的新算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, a new procedure is developed to solve complex constrained linear quadratic optimal control problem. To do that, the problem is firstly decomposed and reformulated to an equivalent optimization one. Then, the resulted necessary conditions of optimality arc solved within a two-level structure. Under the assumption that the original problem has a solution, the convergence behavior of the algorithm is investigated. It is shown that the algorithm converges to the optimal solution. Simulation results of the paper-machine design problem arc given to illustrate the effectiveness of the developed technique.
机译:本文提出了一种解决复杂约束线性二次最优控制问题的新方法。为此,首先将问题分解并重新构造为等效的优化问题。然后,在两个层次的结构中解决了所得的最优性必要条件。在原始问题有解决方案的假设下,研究了算法的收敛性。结果表明,该算法收敛于最优解。给出了纸机设计问题的仿真结果,以说明所开发技术的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号