scholarly journals Alternating direction method of multiplier for the unilateral contact problem with an automatic penalty parameter selection

2020 ◽  
Vol 78 ◽  
pp. 706-723
Author(s):  
Amina Chorfi ◽  
Jonas Koko
2017 ◽  
Vol 34 (06) ◽  
pp. 1750030 ◽  
Author(s):  
Zhongming Wu ◽  
Min Li ◽  
David Z. W. Wang ◽  
Deren Han

In this paper, we propose a symmetric alternating method of multipliers for minimizing the sum of two nonconvex functions with linear constraints, which contains the classic alternating direction method of multipliers in the algorithm framework. Based on the powerful Kurdyka–Łojasiewicz property, and under some assumptions about the penalty parameter and objective function, we prove that each bounded sequence generated by the proposed method globally converges to a critical point of the augmented Lagrangian function associated with the given problem. Moreover, we report some preliminary numerical results on solving [Formula: see text] regularized sparsity optimization and nonconvex feasibility problems to indicate the feasibility and effectiveness of the proposed method.


2015 ◽  
Vol 740 ◽  
pp. 929-932
Author(s):  
Ya Ming Ren ◽  
Shu Min Fei ◽  
Hai Kun Wei

The alternating direction method has been widespread used to solve multi-area economic dispatch problem. Compared with traditional centered economic dispatch, alternating direction method divides centered optimal problem into completely independent sub-problems while the corresponding equality and inequality constraints are satisfied. However, plenty of applications show that the choice of penalty parameter for the consistency constraint has an important influence on the convergence performance of alternating direction method. In this paper, we proposed a novel improved alternating direction method. To be more exact, the key is to adjust penalty parameter based on iterative information of alternating direction method. Numerical results illustrate the proposed method has better stability in convergence.


Author(s):  
Ning Quan ◽  
Harrison Kim

The Alternating Direction Method of Multipliers (ADMM) is a distributed algorithm suitable for quasi-separable problems in Multi-disciplinary Design Optimization. Previous authors have studied the convergence and complexity of the ADMM algorithm by treating it as an instance of the proximal point algorithm. In this paper, those previous results are extended to an alternate form of the ADMM algorithm applied to the quasi-separable problem. Secondly, a dynamic penalty parameter updating heuristic for the ADMM algorithm is introduced and compared against a previously proposed updating heuristic. The proposed updating heuristic was tested on a distributed linear model fitting example and performed favorably against the other heuristic and the fixed penalty parameter scheme.


Sign in / Sign up

Export Citation Format

Share Document