Sequential Convex Programming, SCP
Author: Tianjiang Shuo
Website: https://cislunarspace.cn
Definition
A method that approximates a non-convex optimal control problem as a series of convex optimization subproblems through successive convexification. At each iteration, non-convex constraints are convexified about the current solution, the convex subproblem is solved, and the reference point is updated. It exhibits good convergence and real-time performance but requires customized interior-point solvers, increasing engineering implementation complexity.
Application Value
The 序列凸规划 concept is applied in cislunar space research, providing technical support or analytical methods for lunar exploration missions.
Related Concepts
- Sequential Quadratic Programming
References
- Wang 等 - 2024 - Low-energy earth–moon transfer autonomous guidance considering high-fidelity orbital dynamics