--- title: Successive Convex Optimization (SCO) url: https://www.emergentmind.com/topics/successive-convex-optimization-sco type: topic --- # Successive Convex Optimization (SCO) Successive Convex Optimization (SCO), also commonly known as Successive Convex Approximation (SCA), is a unifying algorithmic framework for tackling nonconvex optimization problems by iteratively constructing and minimizing convex surrogate subproblems. These procedures are designed to preserve essential first-order information of the original problem, enabling provable convergence guarantees under general smoothness or boundedness conditions. SCO methods have broad application in large-scale nonconvex optimization, nonconvex optimal control, machine learning, communications, signal processing, and distributed optimization. ## 1. Principle and General Framework The central principle of SCO is to iteratively replace the nonconvex objective (and possibly constraints) with tractable, convex surrogates that are tangent to the original function at the current iterate. At iteration $t$, given the current point $x^t$, a convex function $\tilde f(x; x^t)$ is constructed such that - $\tilde f(\cdot; x^t)$ is convex in $x$, - $\tilde f(x^t; x^t) = f(x^t)$, - $\nabla_x \tilde f(x^t; x^t) = \nabla f(x^t)$, and typically (for global upper-bound surrogates) $\tilde f(x; x^t) \geq f(x)$ for all $x$. The basic update is \[ x^{t+1} = \arg\min_{x \in \mathcal X} \left\{ \tilde f(x; x^t) + \frac{1}{2\alpha_t} \| x - x^t \|^2 \right\}, \] where $\mathcal X$ is a convex feasible set and $\alpha_t > 0$ is a proximal regularization parameter or step-size. This template encompasses various schemes, including majorization–minimization, trust-region methods, and proximal algorithms [1805.06963]. ## 2. Algorithmic Realizations and Variants Several algorithmic variants have been developed to address specific nonconvexities, constraints, distributed architectures, and stochastic scenarios: - **Plain SCA for Smooth Nonconvex Problems:** Each iterate solves a convex subproblem matching function value and gradient at the expansion point, leading to convergence to first-order stationary points at $O(1/\epsilon^2)$ rates under $L$-smoothness and suitable step-size [1903.01932, 1805.06963]. - **Perturbed SCA (P-SCA) for Saddle-Point Escape:** Standard SCA can stall at strict saddle points. Introducing random perturbations when the gradient norm is small enables convergence to $\epsilon$-second-order stationary points (i.e., local minima), with overall complexity $O(1/\epsilon^2 \cdot \mathrm{polylog}\,d)$ [1903.01932]. - **Block-Coordinate and Parallel SCA:** For problems with block structure, multiple variable blocks (coordinates) can be updated in parallel by minimizing local convex surrogates, improving scalability. Theoretical guarantees cover both cyclic and randomized block updates, with $O(1/\epsilon)$ complexity for nonconvex objectives under mild assumptions [1406.3665]. - **Distributed SCA:** In multi-agent networks, each agent constructs a local surrogate and coordinates updates via consensus or gradient-tracking, achieving convergence to stationary solutions globally [2004.14882, 1805.06963]. - **Stochastic SCA:** When objectives or constraints involve expectations over random variables, surrogates are constructed using sampled gradients and recursive averaging (see CSSCA/SSCA frameworks). These schemes guarantee almost sure convergence to KKT points under diminishing step-sizes and suitable surrogate consistency [1801.08266, 1908.11015, 1801.08274, 2404.11790]. - **Convexification for Optimal Control (SCP/SCvx):** SCO underpins direct methods in optimal control, especially for trajectory optimization under nonconvex dynamics and constraints. Here, complex constraints are handled via exact penalization and linearization, with trust regions and virtual controls ensuring feasibility and strong convergence properties [1804.06539, 1701.00558, 1901.02145, 2404.16826]. ## 3. Guarantees: Convergence and Complexity Theoretical analysis of SCO methods provides rigorous guarantees under standard smoothness and boundedness assumptions: | Variant | Stationarity Guarantee | Iteration Complexity | Key References | |------------------------|------------------------------------------------|---------------------------|------------------------------| | Plain SCA | 1st-order stationarity ($\|\nabla f(x)\| \leq \epsilon$) | $O(1/\epsilon^2)$ | [1903.01932], [1805.06963] | | P-SCA (with perturbation) | 2nd-order stationarity (local minimum) | $O(1/\epsilon^2\,\mathrm{polylog}\,d)$ | [1903.01932] | | Block-coordinate/parallel | 1st-order (nonconvex, deterministic/randomized) | $O(1/\epsilon)$ | [1406.3665] | | Stochastic SCA | KKT (almost sure, general stochastic) | See below | [1801.08266], [1908.11015], [2404.11790] | | SCvx for optimal control | KKT for original/penalized problem | Superlinear (under KL) | [1804.06539], [1701.00558] | In stochastic settings, complexity is typically defined in terms of the number of stochastic first-order oracle (SFO) calls needed to achieve $\epsilon$-stationarity in expectation. Recent methods (e.g., CoSTA) achieve near-optimal $O(\epsilon^{-3/2})$ SFO complexity — matching the lower bounds for unconstrained stochastic nonconvex optimization [2404.11790]. ## 4. Surrogate Design and Practical Considerations SCO success hinges on the careful construction of convex surrogates, tailored to the problem structure: - **Quadratic Majorant:** $\tilde f(x; x^t) = f(x^t) + \nabla f(x^t)^T (x-x^t) + \frac{C}{2}\|x-x^t\|^2$ - **Structured/Partial Linearization:** Linearize only nonconvex terms, retain exact convex terms, and add a proximal regularization [1805.06963, 1801.08266]. - **Adaptive Parameter Selection:** Step-sizes or proximal regularization are chosen based on the surrogate curvature and Lipschitz constants. Practical implementation often replaces unknown constants with empirical or order-of-magnitude estimates [1903.01932]. - **Penalty and Trust Region Methods:** For feasibility and rapid convergence in nonconvex optimal control, penalization of dynamic residuals, virtual controls, and shrinking trust regions are effective for preventing artificial infeasibility [1804.06539, 1701.00558, 2404.16826]. Efficient convex solvers (e.g., QP, SOCP, interior-point, dual ascent) make per-iteration computational cost manageable even for large-scale instances [1804.06539, 1805.06963]. ## 5. Selected Applications and Empirical Results SCO has achieved broad impact in: - **Communications and Signal Processing:** Optimizing transmit covariances and beamforming under nonconvex stochastic constraints [1801.08266, 2412.05828]. - **Machine Learning:** Training neural networks, distributed nonconvex learning, and sparse regression [2004.14882, 2404.11790]. - **Trajectory Optimization and Control:** Spacecraft trajectory design, real-time quadrotor motion planning, collision-avoidance, and rocket landing under nonlinear and nonconvex state constraints [1804.06539, 1901.02145, 1701.00558, 2404.16826]. - **Resource Allocation & Power Control:** Massive-MIMO hybrid precoding, wireless resource allocation with stochastic channel models [1801.08274, 2412.05828]. Empirical studies consistently show that SCO-based methods provide faster convergence than plain gradient descent, high-quality local minima, and—when applicable—efficient saddle-point escape [1903.01932, 1805.06963]. In convexified trajectory optimization, SCvx/SCO methods achieve real-time performance with global optimality for convexized subproblems and rapid convergence (often a few tens of iterations) [1701.00558, 1804.06539, 2404.16826]. ## 6. Open Directions and Limitations Active research topics include: - **Global Certificate Extensions:** While SCO converges to stationary points, global optimality in nonconvex settings remains out of reach except under special convexification or exact-penalty settings. - **Refined Complexity Bounds:** Closing the gap between theory and practice regarding tuning surrogate curvature and step-sizes; joint optimization for worst-case iteration complexity and per-iteration wall-clock time [2404.11790]. - **Saddle-Point Escaping Beyond Smooth Unconstrained Case:** Extending second-order guarantees to constrained, stochastic, and distributed SCA variants is an open problem [1903.01932]. - **Scalability in Large-Scale Networks:** Communication overhead can outweigh computational speed-up in distributed/parallel SCA with many agents; efficient orchestration is required [1406.3665, 1805.06963, 2004.14882]. - **Adaptive Surrogate Construction:** Developing surrogates leveraging problem structure, such as structured sparsity, decoupling via inequalities (e.g., AM/GM bounds [2412.05828]) for improved empirical performance. ## 7. Summary Table: Core SCO Algorithmic Structure | Step | Description | |--------------------------------------------|------------------------------------------------------------------------| | 1. Surrogate construction | Build convex $\tilde f(x; x^t)$ tangent to $f$ at $x^t$ | | 2. (Optional) Convexification of constraints| Build convex surrogates for constraints | | 3. Solve convex subproblem | $x^{t+1} = \arg\min \tilde f(x; x^t) +$ (reg.) s.t. (surrogate constraints) | | 4. (Optional) Relaxed update/stepsize | $x^{t+1} \leftarrow x^t + \eta_t (x^{t+1} - x^t)$ | | 5. Termination/test for stationarity | Stop if stationarity/feasibility achieved; else $t \rightarrow t+1$ | These steps, adjustable for distributed, stochastic, or block-coordinate environments, constitute the core of all modern SCO/SCA methods [1805.06963, 2004.14882, 1801.08266, 1406.3665]. --- **References**: - [1903.01932]: Escaping Saddle Points with the Successive Convex Approximation Algorithm - [1805.06963]: Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization - [1406.3665]: Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization - [1801.08266]: Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization - [2004.14882]: Distributed Stochastic Nonconvex Optimization and Learning based on Successive Convex Approximation - [1804.06539]: Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems - [1701.00558]: Successive Convexification of Non-Convex Optimal Control Problems with State Constraints - [1901.02145]: Solar-Sail Deep Space Trajectory Optimization Using Successive Convex Programming - [2404.11790]: Constrained Stochastic Recursive Momentum Successive Convex Approximation - [2412.05828]: Applications of Inequalities to Optimization in Communication Networks: Novel Decoupling Techniques and Bounds for Multiplicative Terms Through Successive Convex Approximation - [2404.16826]: Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction Source: https://www.emergentmind.com/topics/successive-convex-optimization-sco