Abstract
Sequential second-order cone programming (SSOCP) is commonly used in aerospace applications for solving nonlinear trajectory optimization problems. The SSOCP possesses good real-time performance. However, one long-standing challenge is its unguaranteed convergence. In this paper, we theoretically analyze the descent property of the penalty function in the SSOCP. Using Karush–Kuhn–Tucker conditions, we obtain two important theoretical results: 1) the penalty function of the original nonlinear problem always descends along the iteration direction; 2) a sufficiently small trust region can decrease the penalty function. Based on these two results, we design an improved trust region shrinking algorithm with theoretically guaranteed convergence. In numerical simulations, we verify the proposed algorithm using a reentry trajectory optimization problem.
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.
