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 L 1 penalty function in the SSOCP. Using Karush–Kuhn–Tucker conditions, we obtain two important theoretical results: 1) the L 1 penalty function of the original nonlinear problem always descends along the iteration direction; 2) a sufficiently small trust region can decrease the L 1 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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Descent Property in Sequential Second-Order Cone Programming for Nonlinear Trajectory Optimization


    Contributors:
    Xie, Lei (author) / Zhou, Xiang (author) / Zhang, Hong-Bo (author) / Tang, Guo-Jian (author)

    Published in:

    Publication date :

    2023-12-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English