Remarks on "Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems"

2024/03/01 by Dayou Luo, Luo, Dayou, Purnanand Elango +3 · 1 citation
Computer Science · Engineering · #Advanced Control Systems Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis #Stability and Control of Uncertain Systems

paper · pdf · doi:10.48550/arxiv.2403.00733

openalex publication_date 2024/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The purpose of this note is to highlight and address inaccuracies in the convergence guarantees of SCvx, a nonconvex trajectory optimization algorithm proposed by Mao et al. (arXiv:1804.06539), and make connections to relevant prior work. Specifically, we identify errors in the convergence proof within Mao et al. (arXiv:1804.06539) and reestablish the proof of convergence by employing a new method under stricter assumptions.

Cited by

• Efficient Input-Constrained Impulsive Optimal Control of Linear Systems with Application to Spacecraft Relative Motion

Related

• Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems
• SCvx-fast: A Superlinearly Convergent Algorithm for A Class of Non-Convex Optimal Control Problems
• Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction
• Non-Convex Global Optimization as an Optimal Stabilization Problem: Convergence Rates
• Global Convergence of Successive Approximations for Non-convex Stochastic Optimal Control Problems