Accelerated convergence of time‐splitting algorithm by relaxation method
Abstract The alternating direction method of multipliers (ADMM) is a widely used model predictive control (MPC) acceleration method. It adopts the time‐splitting technique, splitting the original problem into independent subproblems. Relaxed ADMM (R‐ADMM) is a generalization of ADMM that often achie...
Main Authors: | Jiaxin Gao, Shengbo Eben Li, Fei Ma, Wenyu Li, Hao Sun, Maierdanjiang Maihemuti, Chun Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-05-01
|
Series: | IET Control Theory & Applications |
Online Access: | https://doi.org/10.1049/cth2.12270 |
Similar Items
-
Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces
by: Tingting Tian, et al.
Published: (2019-03-01) -
Split proximal linearized algorithm and convergence theorems for the split DC program
by: Chih-Sheng Chuang, et al.
Published: (2019-05-01) -
About the relaxed cocoercivity and the convergence of the proximal point algorithm
by: Abdellatif Moudafi, et al.
Published: (2013-10-01) -
Convergence of an accelerated distributed optimisation algorithm over time‐varying directed networks
by: Jinhui Hu, et al.
Published: (2021-01-01) -
Modified Relaxed CQ Iterative Algorithms for the Split Feasibility Problem
by: Xinglong Wang, et al.
Published: (2019-01-01)