<p>The saddle-point problems (SPPs) with nonlinear coupling operators frequently arise in various control systems, such as dynamic programming optimization, H-infinity control, and Lyapunov stability analysis. However, traditional primal-dual methods are constrained by fixed regularization factors. In this paper, a novel generalized primal-dual correction method (GPD-CM) is proposed to adjust the values of regularization factors dynamically. It turns out that this method can achieve the minimum theoretical lower bound of regularization factors, allowing for larger step sizes under the convergence condition being satisfied. The convergence of the GPD-CM is directly achieved through a unified variational framework. Theoretical analysis shows that the proposed method can achieve an ergodic convergence rate of <i>O</i>(1/<i>t</i>). Numerical results support our theoretical analysis for an SPP with an exponential coupling operator.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Generalized Primal-dual Correction Method for Saddle-point Problems With a Nonlinear Coupling Operator

  • Sai Wang,
  • Yi Gong

摘要

The saddle-point problems (SPPs) with nonlinear coupling operators frequently arise in various control systems, such as dynamic programming optimization, H-infinity control, and Lyapunov stability analysis. However, traditional primal-dual methods are constrained by fixed regularization factors. In this paper, a novel generalized primal-dual correction method (GPD-CM) is proposed to adjust the values of regularization factors dynamically. It turns out that this method can achieve the minimum theoretical lower bound of regularization factors, allowing for larger step sizes under the convergence condition being satisfied. The convergence of the GPD-CM is directly achieved through a unified variational framework. Theoretical analysis shows that the proposed method can achieve an ergodic convergence rate of O(1/t). Numerical results support our theoretical analysis for an SPP with an exponential coupling operator.