Abstract
SUMMARY This 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
