Skip to content
Open access

Complementarity-Gap-Driven Adaptive Sequential Convex Programming for Reentry Trajectory Optimization

Sep 2026 · Aerospace · Vol 13, pp. 838 · 0 citations · 26 references

Abstract

To address the issue that existing penalty weight update strategies in the augmented Lagrangian multiplier method are disconnected from the optimality conditions and remain relatively sensitive to initial parameters, this paper proposes a complementarity-gap-driven adaptive sequential convex programming algorithm. The algorithm directly incorporates the complementarity slackness information from the KKT conditions into the parameter update laws. The defined complementarity slackness ratio and complementarity gap respectively measure the deviation of the current penalty intensity from the ideal multiplier level and the degree of departure from the complementarity slackness condition. Based on these two quantities, a bidirectional smooth update law for the penalty weight and a normalized gap update law for the multiplier are designed, which decouple the multiplier growth from the current multiplier magnitude. On this basis, a complete theoretical convergence framework is established, in which the monotonic bounded convergence of the Lagrange multiplier and the convergence of the slack variables and the complementarity gap are rigorously proved, and a conditional convergence theorem is given. Taking the reentry trajectory planning problem of a gliding vehicle as an example, numerical simulations are conducted with the initial penalty weight spanning five orders of magnitude. Simulation results demonstrate that the proposed algorithm converges rapidly and stably to the optimal solution satisfying the accuracy requirements under different initial weights, with the terminal position error stabilizing at 0.4–0.5 km, exhibiting favorable convergence accuracy. In addition, the stable convergence exhibited by the complementarity gap and the slackness radius validates the effectiveness and robustness of the complementarity-gap-driven adaptive update mechanism.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Equilibrium bias and convergence in augmented primal--dual dynamics with sampled constraints

This work studies the stability and convergence of augmented primal-dual dynamics when constraint values are estimated from samples. Unbiased constraint observations can produce a biased augmented multiplier signal, shifting the equilibria of the mean dynamics. For componentwise inequalities, we give a necessary and su...

Kang Liu, Meng-Xiao Chen, Si-Qin Xiong et al. · 0 citations
Preprint Sep 2026

Accelerated primal-dual dynamics and algorithms for convex optimization with nonlinear inequality constraints

This work considers convex optimization with nonlinear inequality constraints and develops a primal-dual multiplier framework that is consistent in continuous and discrete time and is the first Nesterov-type primal-dual multiplier framework for convex optimization with nonlinear inequality constraints.

Xin He · 0 citations
Preprint Aug 2026

Reciprocal-Manifold Annealed KKT Flows for Constrained Optimization: Application to the Nonconvex AC Optimal Power Flow

Safety-critical optimization applications, such as real-time power system operation, maintain feasibility at every intermediate step, not merely at convergence. Existing approaches either violate constraints mid-solve (interior-point methods) or enforce feasibility through per-instant quadratic programming subproblems...

M. Parimi, Aditi Ramteke, Rachit Mehra et al. · 0 citations
Preprint Aug 2026

A Fixed-Penalty Linearized Augmented Lagrangian Method with Classical Multiplier Updates

This work proposes a nonlinear-residual linearized augmented Lagrangian method (NR-LALM) that replaces this subproblem by a regularized Gauss-Newton-type step while retaining the classical multiplier update based on the nonlinear constraint residual.

Ben-Qi Liu, Kangkang Deng, Zichen Wang et al. · 0 citations
Preprint Sep 2026

SPPID: Saddle-Point PID for Constrained Optimization

This paper studies constrained optimization problems through the lens of feedback control. Building on the interpretation of Lagrange multipliers as feedback controllers, we propose the \emph{saddle-point PID (SPPID) dynamics}: a unified proportional--integral--derivative (PID) framework for continuous-time saddle-poin...

Veronica Centorrino, Rawan Hoteit, Efe C. Balta et al. · 0 citations
Open access Sep 2026

Disjunctive Programming and Piecewise Convexity: An Algorithmic Trajectory Analysis Toward Stationary Points to Avoid the Maratos Effect in Numerical Optimization

An algorithmic modeling approach based on Disjunctive Programming using Boolean logic “OR” to solve the Optimal Phasor Measurement Unit Placement (OPP) and a framework for modeling the optimal PMU placement subject to disjunctive constraints is proposed.

Nikolaos P. Theodorakatos, Miltiadis Demetrios Lytras, Rohit Babu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.