This article presents a methodology to reduce the convexification loss in sequential convex programming for a class of nonconvex optimal control problems. The nonconvexity arises from the presence of smooth concave inequality constraints or polyhedral exclusion constraints. The concave inequality constraints are approximated by successive linearization, with the convexification loss reduced either by reconstructing concave functions or revising expansion points. The expansion point revision results in a weak loss convexification. Moreover, polyhedral exclusion constraints are approximated by separating hyperplanes. The convexification loss can be reduced by solving additional dual problems or identifying the supporting hyperplanes, both of which result in weak loss convexifications. The four methods are demonstrated to have no impact on the iterative feasibility and convergence of sequential convex programming. Simulation demonstrates that the reduction of convexification loss can reduce the conservatism during the iteration process, which in turn has the potential to reduce the number of iterations and computation time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Weak Loss Convexification for Sequential Convex Programming


    Contributors:
    Deng, Yunshan (author) / Xia, Yuanqing (author) / Sun, Zhongqi (author) / Li, Chang (author) / Hu, Rui (author)


    Publication date :

    2025-04-01


    Size :

    3082820 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    CONVEX PROGRAMMING-BASED OPTIMAL THREE-DIMENSIONAL MID-COURSE GUIDANCE WITH LOSSLESS CONVEXIFICATION

    Jung, C. / Lee, C. / Tahk, M. | British Library Conference Proceedings | 2022


    Lossless Convexification for Quadrotors

    Merewether, Gene / Tzanetos, Theodore / Gardiner, Mathew | NTRS | 2018


    Successive Convexification for Tethered Debris Deorbiting

    Field, Liam / Hecht, Grant / Botta, Eleonora M. | AIAA | 2024



    Successive Convexification for Fuel-Optimal Powered Landing with Aerodynamic Drag and Non-Convex Constraints (AIAA 2016-0378)

    Szmuk, Michael / Acikmese, Behcet / Berning, Andrew W. | British Library Conference Proceedings | 2016