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
Parents
275
1–5 of 275
728
11
h-index
10
h-index
8
h-index
7
h-index
5
h-index
1–5 of 728
276
Stanford University
Stanford, United States
15 h-index
38 publications
3.3K citations

Beijing Institute of Technology
Beijing, China
13 h-index
42 publications
1.3K citations
KU Leuven
Leuven, Belgium
11 h-index
37 publications
1.6K citations

Vaughn College of Aeronautics and Technology
New York, United States
10 h-index
21 publications
2K citations
Jet Propulsion Laboratory
Pasadena, United States
9 h-index
14 publications
1.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
21 publications
1.7K citations
California Institute of Technology
Pasadena, United States
7 h-index
12 publications
266 citations

University of Oulu
Oulu, Finland
7 h-index
20 publications
1.6K citations
1–8 of 276
11 publications · 487 citations
11
h-index
9 publications · 357 citations
9
h-index
9 publications · 700 citations
9
h-index
9 publications · 932 citations
9
h-index
8 publications · 283 citations
8
h-index
1–5