SuperADMM: Solving Quadratic Programs Faster with Dynamic Weighting ADMM

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.

Original languageEnglish
Title of host publication2025 29th International Conference on System Theory, Control and Computing, ICSTCC 2025 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers
Pages569-575
Number of pages7
ISBN (Electronic)979-8-3315-9621-7
DOIs
Publication statusPublished - 20 Nov 2025
Event2025 29th International Conference on System Theory, Control and Computing, ICSTCC 2025 - Cluj-Napoca, Romania
Duration: 9 Oct 202511 Oct 2025

Conference

Conference2025 29th International Conference on System Theory, Control and Computing, ICSTCC 2025
Country/TerritoryRomania
CityCluj-Napoca
Period9/10/2511/10/25

Bibliographical note

Publisher Copyright:
© 2025 IEEE.

Keywords

  • Alternating direction method of multipliers
  • Dynamic weighting
  • Model predictive control
  • Quadratic programming
  • Superlinear convergence

Fingerprint

Dive into the research topics of 'SuperADMM: Solving Quadratic Programs Faster with Dynamic Weighting ADMM'. Together they form a unique fingerprint.

Cite this