SuperADMM: Solving Quadratic Programs Faster with Dynamic Weighting ADMM
Abstract
In this paper we develop an accelerated Alternating Direction Method of Multipliers (ADMM) algorithm for solving quadratic programs called superADMM. Unlike standard ADMM QP solvers, superADMM uses a novel dynamic weighting method that penalizes each constraint individually and performs weight updates at every ADMM iteration. We provide a numerical stability analysis, methods for parameter selection and infeasibility detection. The algorithm is implemented in c with efficient linear algebra packages to provide a short execution time and allows calling superADMM from popular languages such as MATLAB and Python. A comparison of superADMM with state-of-the-art ADMM solvers and widely used commercial solvers showcases the efficiency and accuracy of the developed solver.
Cite
@article{arxiv.2506.11608,
title = {SuperADMM: Solving Quadratic Programs Faster with Dynamic Weighting ADMM},
author = {P. C. N. Verheijen and D. Goswami and M. Lazar},
journal= {arXiv preprint arXiv:2506.11608},
year = {2025}
}
Comments
8 pages, 2 figures, submitted to the 29th International Conference on System Theory, Control and Computing