Through the years, Sequential Convex Programming (SCP) has gained great interest as an efficient tool for non-convex optimal control . Despite the large number of existing algorithmic frameworks, only a few are accompanied by rigorous convergence analysis, which are often only tailored to discrete-time problem formulations. In this paper, we present a unifying theoretical analysis of a fairly general class of SCP procedures which is applied to the original continuous-time formulation. Besides the extension of classical convergence guarantees to continuous-time settings , our analysis reveals two new features inherited by SCP-type methods . First, we show how one can more easily account for manifold-type constraints, which play a key role in the optimal control of mechanical systems. Second, we demonstrate how the theoretical analysis may be leveraged to devise an accelerated implementation of SCP based on indirect methods . Detailed numerical experiments are provided to show the key benefits of a continuous-time analysis to improve performance .
 Sequential Convex Programming (SCP) has recently gained significant popularity as an effective method for solving optimal control problems and has been successfully applied in several different domains. However, the theoretical analysis of SCP has received comparatively limited attention, and it is often restricted to discrete-time formulations. In this paper, we present a unifying theoretical analysis of a fairly general class of SCP procedures for continuous-time optimal control problems. In addition to the derivation of convergence guarantees in a continuous-time setting , our analysis reveals two new numerical and practical insights . First, we show how one can more easily account for manifold-type constraints, which are a defining feature of optimal control of mechanical systems. Second, we show how our theoretical analysis can be leveraged to accelerate SCP-based optimal control methods by infusing techniques from indirect optimal control .
D
Through the years,
R
gained great interest as an efficient tool for non-convex optimal control . Despite the large number of existing algorithmic frameworks, only a few are accompanied by rigorous convergence analysis, which are often only tailored
recently gained significant popularity as an effective method for solving optimal control problems and has been successfully applied in several different domains. However, the theoretical analysis of SCP has received comparatively limited attention, and it is often restricted
D
problem
R
which is applied to the original
for
R
formulation. Besides the extension of classical convergence guarantees to
optimal control problems. In addition to the derivation of convergence guarantees in a
R
settings
setting
R
features inherited by SCP-type methods
numerical and practical insights
R
play a key role in the
are a defining feature of
R
demonstrate how the theoretical analysis may
show how our theoretical analysis can
R
devise an accelerated implementation of SCP based on indirect methods . Detailed numerical experiments are provided to show the key benefits of a continuous-time analysis to improve performance
accelerate SCP-based optimal control methods by infusing techniques from indirect optimal control