返回
摘要
En 中文
SUMMARYThis paper presents an algorithm for the indirect solution of optimal control problems that contain mixed state and control variable inequality constraints. The necessary conditions for optimality lead to an inequality constrained two‐point BVP with index‐1 differential‐algebraic equations (BVP‐DAEs). These BVP‐DAEs are solved using a multiple shooting method where the DAEs are approximated using a single‐step linearly implicit Runge–Kutta (Rosenbrock–Wanner) method. An interior‐point Newton method is used to solve the residual equations associated with the multiple shooting discretization. The elements of the residual equations, and the Jacobian of the residual equations, are constructed in parallel. The search direction for the interior‐point method is computed by solving a sparse bordered almost block diagonal (BABD) linear system. Here, a parallel‐structured orthogonal factorization algorithm is used to solve the BABD system. Examples are presented to illustrate the efficiency of the parallel algorithm. It is shown that an American National Standards Institute C implementation of the parallel algorithm achieves significant speedup with the increase in the number of processors used. Copyright © 2013 John Wiley & Sons, Ltd.
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息

