Successive Convex Optimization

Author: Tianjiang Shuo

Website: https://cislunarspace.cn

Definition

An iterative method that converts a nonlinear optimal control problem into a sequence of convex optimization problems by successively updating the reference trajectory. In each iteration, the dynamics are linearized around the current optimal trajectory to form a convex subproblem.

References

  • Kayama 等 - 2022 - Low-thrust trajectory design with successive convex optimization for libration point orbits