---
title: Sequential Convex Optimization Framework
url: https://www.emergentmind.com/topics/sequential-convex-optimization-framework
type: topic
---

# Sequential Convex Optimization Framework

Sequential convex optimization is a powerful algorithmic paradigm for solving nonconvex optimization problems by iteratively constructing and solving a sequence of convex surrogate subproblems that approximate the original problem in the neighborhood of the current iterate. This framework encompasses methods such as sequential convex programming (SCP), trust-region sequential convex optimization, convex–concave procedures for difference-of-convex (DC) programs, and their modern extensions. The attractiveness of sequential convex optimization lies in the amenability of convex subproblems to efficient global solution, robust convergence theory under mild assumptions, and broad applicability across control, trajectory planning, DC programming, game theory, and robust/nonlinear system analysis.

## 1. General Problem Formulation and Scope

Sequential convex optimization addresses nonconvex minimization problems of the form
\[
\min_{x\in\Omega}\ f_0(x)\quad\text{subject to}\quad f_i(x)\le 0,\quad i=1,\ldots,m,
\]
where the functions $f_0, f_1, \ldots, f_m$ may be nonconvex but possess a structure (e.g., DC decomposition, smoothness, or local convexity under linearization) that enables local convex approximations. The feasible set $\Omega$ is typically convex and closed, but nonconvexities may appear in constraints as differences-of-convex functions, as in
\[
f_i(x) = u_i(x) - v_i(x)\le 0,\quad u_i,v_i\in\Gamma_0(\mathbb{R}^n)\ \text{convex}
\]
[1107.5841]. In robust and control settings, additional parametric and dynamic constraints are present, and in mixed-integer or contact-implicit problems, complementarity and rounding steps may appear [2511.10622, 2502.01055]. The framework also encompasses sequential decision processes and trajectory optimization with equality, inequality, and possibly logic/discrete constraints.

## 2. Core Sequential Convex Optimization Algorithms

At each iteration $k$, sequential convex optimization constructs a convex surrogate subproblem reflecting the local behavior of the original problem near the current iterate $x^k$. The most canonical approach is to preserve convex components and linearize concave or nonlinear terms, exemplified by the DC-programming method:
\[
\text{At }x^k\text{,}\ \forall i:\ f_i(x)=u_i(x) - v_i(x) \approx u_i(x) - v_i(x^k) - (\Xi_i^k)^\top (x-x^k)
\]
with $\Xi_i^k\in\partial v_i(x^k)$ a subgradient, yielding a convex constraint [1107.5841]. The convex subproblem is then
\[
\begin{cases}
\min_{x\in\mathbb{R}^n} & f_0(x) + \frac{\rho}{2}\|x-x^k\|^2 \\
\text{s.t.} & u_i(x) - v_i(x^k) - (\Xi_i^k)^\top(x-x^k)\le 0,\ i=1,\ldots,m \\
& x\in\Omega.
\end{cases}
\]
An analogous strategy is used in trust-region sequential convex optimization for trajectory planning, where nonconvex constraints are linearized at a reference trajectory and embedded within a trust region whose radius adapts according to model fidelity and progress:
\[
\|x - x^k\| \leq \delta_k,\quad \text{accept/reject and adapt } \delta_k\ \text{via reduction ratio } \rho_k
\]
[2506.06012, 1903.00155]. Proximal or penalty terms can be included for regularization and to control steps.

Relaxations with slack variables enable feasibility when linearizations are inconsistent:
\[
u_i(x) - v_i(x^k) - (\Xi_i^k)^\top(x-x^k)\le s_i,\ s_i\ge 0,\quad \mu\sum_i s_i\ \text{penalty}
\]
[1107.5841]. Taylor- or Hessian-based inner-convex approximations, sampled interpolation bundles, and smoothing/penalized merit functions extend the possible surrogate constructions [1810.10439, 2509.26575]. In derivative-free settings, convex subproblems may be constructed via sample-based interpolation and the bundle method, where the iterate is a convex combination of sampled states [2509.26575]. For parametric and online problems, predictor-corrector approaches and adjoint-based corrections accelerate tracking [1109.2800].

## 3. Theoretical Guarantees: Convergence and Feasibility

The sequential convex optimization framework enjoys strong theoretical guarantees under general assumptions:

- **Global Feasibility Preservation**: Inner-approximation property ensures that if the starting point is feasible and inner-convex approximations are used, all iterates remain feasible for the original problem [1107.5841, 1810.10439].
- **Global Convergence to Stationary Points**: Under convexity or mild regularity, every accumulation point of the sequence of iterates is a Karush–Kuhn–Tucker (KKT) point of the original nonconvex problem, and step norms tend to zero [1107.5841, 1903.00155].
- **Descent/Ascent Property**: The sequence of objective values is nonincreasing (for minimization) or nondecreasing (for maximization in ascent algorithms), strictly monotone under certain conditions, and bounded below (or above), ensuring convergence of the objective sequence [1810.10439, 2009.07893].
- **Quadratic or Linear Rate**: With Taylor-based inner-convexification and smoothness, local quadratic convergence is provable [1810.10439]. Standard first-order SCP steps achieve at least linear convergence under strong regularity.
- **Worst-case Guarantees**: Recent verification frameworks encode SCP iterations in a single (mixed-integer) QCQP to yield exact worst-case bounds over parametric families, validating convergence and robustness in a global sense [2511.10622].

The key assumptions are preservation of feasibility under the surrogate model, boundedness of iterates and regularity of the convexified constraints, and—when present—sufficient strength of convexification or regularization to prevent vanishing trust regions.

## 4. Applications Across Domains

Sequential convex optimization has seen broad adoption and validation across diverse domains:

- **DC-Constrained Programming**: The SCP-DC method provides global convergence (to KKT points) and practical success for large-scale nonconvex quadratic constrained quadratic programs (QCQPs) and mathematical programs with complementarity constraints (MPCC); relaxations and slack penalties ensure feasibility even in the presence of inconsistent linearizations [1107.5841].
- **Trajectory and Path Planning**: Trust-region SCP and sample-based bundle methods, derivative-free or otherwise, underpin real-time optimal guidance for vehicles including drones, rockets, and cars, offering fast, high-fidelity solutions with constraint satisfaction across trajectory [2506.06012, 1903.00155, 1704.00095, 2508.14299, 2509.26575, 2212.00375].
- **Robust Optimization and Feasibility Certification**: Sequential convex restriction, via convex sufficient conditions, provides guarantees of robust feasibility under bounded uncertainty and applicability to polynomial optimization and nonlinear network flow problems [1909.01778].
- **Game Theory and Decision Processes**: Laminar regret decomposition transforms general sequential decision processes and extensive-form games into tractable convex subproblems at each node, recovering and generalizing counterfactual regret minimization (CFR) and supporting regularized and quantal response equilibria [1809.03075].
- **Contact-Implicit and Hybrid Systems**: Convexified primal QP SCP with trust-region and merit function globalization achieve robust solution of contact-implicit (complementarity-constrained) motion planning, even in the face of constraint qualification failure [2502.01055].
- **Differentiable Parameter Optimization**: Differentiable SCP platforms enable end-to-end learning and differentiable optimization of algorithmic hyperparameters and vehicle/mission parameters, propagating exact gradients through all SCP layers [2512.03557].

## 5. Algorithmic Structures and Modern Enhancements

Various enhancements reinforce the practical applicability, flexibility, and computational performance of sequential convex optimization:

- **Trust Region Adaptation**: Step acceptance and radius updates governed by modeled and actual reduction ratios (e.g., $\rho = \Delta J_\text{actual} / \Delta J_\text{pred}$) guarantee robustness and enable aggressive or conservative progression [2506.06012, 1903.00155].
- **Slack-Based Relaxation and Penalty Adjustments**: $L_1$ or $L_2$ slack penalties ensure subproblem feasibility, continuous progress on infeasible linearized constraints, and balanced objective–feasibility trade-offs [1107.5841].
- **Adaptive and Derivative-Free Initialization**: Bayesian filtering and bundle interpolation warm-starts leverage statistical models for initialization and foster rapid convergence in online and high-dimensional scenarios [2508.14299, 2509.26575].
- **Adjoint and Predictor–Corrector Acceleration**: Implicit function theorem–based predictor steps and adjoint corrections facilitate path-tracking across parametric or online problems, enabling real-time nonlinear model predictive control in large-scale systems [1109.2800].
- **High-Performance Solvers and Scalability**: The convex QP/SOCP/SOCP subproblems, often sparse and structured, are amenable to efficient interior-point, first-order projection, and GPU-accelerated solvers, yielding per-iteration times suitable for embedded and real-time deployment [2212.00375, 2512.03557].

## 6. Limitations, Verification, and Open Directions

Key challenges and modern responses include:

- **Locality and Suboptimality**: Sequential convex approaches generally guarantee convergence to stationary points, not global optima, though empirical performance is often nearly optimal. Recent MIQCQP-based verification addresses global suboptimality and constraint satisfaction over parametric spaces [2511.10622].
- **Linearization Validity/Trust-Region Shrinkage**: Poor surrogate fidelity, especially in highly nonlinear regimes or with ill-chosen trust-region radii, may impede convergence. Adaptive shrinkage and model-based acceptance strategies mitigate this risk.
- **Constraint Qualification Failures**: In problems such as MPCC or contact-implicit planning, the lack of classical constraint qualifications precludes standard dual methods; primal-only exact penalty and slack strategies preserve progress [2502.01055].
- **Computational Complexity**: While each subproblem is convex, large-scale instances with high-dimensional or logic constraints (e.g., integer, complementarity, sampling) can be computationally demanding. Exploiting problem structure and parallelizing function evaluation and bundle construction ameliorates these costs [2509.26575, 2212.00375].
- **Derivative-Free and Non-Smooth Extensions**: Extending sequential convex optimization to non-smooth, black-box, or simulation-driven settings is active, with the sample-based bundle framework providing a principled path [2509.26575].

The framework is active in high-dimensional mission design, learning-augmented control, and robust optimization with ongoing research on objective tightness, global certification, and algorithmic acceleration.

---

**References**

- "Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints" [1107.5841]
- "Enhanced Trust Region Sequential Convex Optimization for Multi-Drone Thermal Screening Trajectory Planning in Urban Environments" [2506.06012]
- "Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games" [1809.03075]
- "GuSTO: Guaranteed Sequential Trajectory Optimization via Sequential Convex Programming" [1903.00155]
- "Verification of Sequential Convex Programming for Parametric Non-convex Optimization" [2511.10622]
- "Speed trajectory planning at signalized intersections using sequential convex optimization" [1704.00095]
- "Sequential Convex Restriction and its Applications in Robust Optimization" [1909.01778]
- "Real-Time Sequential Conic Optimization for Multi-Phase Rocket Landing Guidance" [2212.00375]
- "Adjoint-based predictor-corrector sequential convex programming for parametric nonlinear optimization" [1109.2800]
- "A recursively feasible and convergent Sequential Convex Programming procedure to solve non-convex problems with linear equality constraints" [1810.10439]
- "Largest small polygons: A sequential convex optimization approach" [2009.07893]
- "On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning" [2502.01055]
- "The Trajectory Bundle Method: Unifying Sequential-Convex Programming and Sampling-Based Trajectory Optimization" [2509.26575]
- "Sequential Convex Programming with Filtering-Based Warm-Starting for Continuous-Time Multiagent Quadrotor Trajectory Optimization" [2508.14299]
- "Parameters Optimization in Trajectory Planning Using Diffrentiable Convex Programing" [2512.03557]

Source: https://www.emergentmind.com/topics/sequential-convex-optimization-framework