An Improvement of the Alternating Direction Method of Multipliers to Solve the Convex Optimization Problem
Open Access
- 28 February 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (5) , 811
Abstract
The alternating direction method is one of the attractive approaches for solving convex optimization problems with linear constraints and separable objective functions. Experience with applications has shown that the number of iterations depends significantly on the penalty parameter for the linear constraint. The penalty parameters in the classical alternating direction method are a constant. In this paper, an improved alternating direction method is proposed, which not only adaptively adjusts the penalty parameters per iteration based on the iteration message but also adds relaxation factors to the Lagrange multiplier update steps. Preliminary numerical experiments show that the technique of adaptive adjusting of the penalty parameters per iteration and attaching relaxation factors in the Lagrange multiplier updating steps are effective in practical applications.Keywords
Funding Information
- National Natural Science Foundation of China (11961012, AD20297063)
- Special Research Project for Guangxi Young Innovative Talents (11961012, AD20297063)
This publication has 27 references indexed in Scilit:
- An inexact version of the symmetric proximal ADMM for solving separable convex optimizationNumerical Algorithms, 2023
- An inexact accelerated stochastic ADMM for separable convex optimizationComputational Optimization and Applications, 2022
- Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameterCalcolo, 2020
- Convergence rates for an inexact ADMM applied to separable convex optimizationComputational Optimization and Applications, 2020
- Symmetric Alternating Direction Method with Indefinite Proximal Regularization for Linearly Constrained Convex OptimizationJournal of Optimization Theory and Applications, 2017
- Generalized symmetric ADMM for separable convex optimizationComputational Optimization and Applications, 2017
- A customized Douglas–Rachford splitting algorithm for separable convex minimization with linear constraintsNumerische Mathematik, 2013
- A proximal point algorithm revisit on the alternating direction method of multipliersScience China Mathematics, 2013
- A new method for a class of linear variational inequalitiesMathematical Programming, 1994
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969