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.
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
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.
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
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
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
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.