Sequential Convex Programming

Sequential Convex Programming is a trajectory optimization method that iteratively approximates a non-convex optimal control problem by a sequence of convex subproblems, which are solved to generate progressively refined feasible solutions approaching a locally optimal trajectory.

275

Publications

18.6K

Citations

728

Authors

276

Institutions

Publications per year

2017–2026

163

Variants

Scp

Authors

728

  1. MD
    Moritz Diehl

    KU Leuven, Belgium

    11 publications · 419 citations

    11

    h-index

  2. SC
    Soon‐Jo Chung

    University of Illinois Urbana-Champaign, United States

    10 publications · 776 citations

    10

    h-index

  3. FY
    Fred Y. Hadaegh

    Jet Propulsion Laboratory, United States

    8 publications · 723 citations

    8

    h-index

  4. ZW
    Zhenbo Wang

    University of Tennessee at Knoxville, United States

    7 publications · 555 citations

    7

    h-index

  5. RB
    Riccardo Bonalli

    Stanford University, United States

    5 publications · 469 citations

    5

    h-index

1–5 of 728

Venues

  1. IEEE Transactions on Vehicular Technology

    11 publications · 487 citations

    11

    h-index

  2. IEEE Access

    9 publications · 357 citations

    9

    h-index

  3. IEEE Transactions on Signal Processing

    9 publications · 700 citations

    9

    h-index

  4. Journal of Guidance Control and Dynamics

    9 publications · 932 citations

    9

    h-index

  5. IEEE Communications Letters

    8 publications · 283 citations

    8

    h-index

1–5