Accelerated convergence of time-splitting algorithm by relaxation method

DOI10.1049/CTH2.12270MaRDI QIDQ6906887zbMATH OpenFDO

Authors Jiaxin Gao, Fei Ma, Wenyu Li, Maierdanjiang Maihemuti, Chun Jin, Hao Sun

Publication date 4 November 2025

Published in IET Control Theory \& Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1049/CTH2.12270

Mathematics Subject Classification ID

Model predictive control (93B45)

Cites work

• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• An ADMM-based interior-point method for large-scale linear programming
• An algorithm for multi-parametric quadratic programming and explicit MPC solutions
• CVXGEN: a code generator for embedded convex optimization
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Hankel matrix rank minimization with applications to system identification and realization
• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 41029 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
• Parallel alternating direction multiplier decomposition of convex programs

This page was built for publication: Accelerated convergence of time-splitting algorithm by relaxation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906887)