A Convergent ADMM Algorithm for Grain Boundary Energy Minimization
Journal of Scientific Computing · 2026-09 · 108 (3)
DOI: 10.1007/s10915-026-03410-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Scientific Computing, online erschienen am 25.07.2026. Verfasst von Yue Wu und 2 weiteren Autor:innen. Die Arbeit nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Hong Kong Research Grants Council General Research Fund, Hong Kong Research Grants Council Collaborative Research Fund, Project of Hetao Shenzhen-HKUST Innovation Cooperation Zone.
Abstract (Originalsprache)
In this paper, we study a constrained minimization problem that arises from materials science to determine the dislocation (line defect) structure of grain boundaries. The problem aims to minimize the energy of the grain boundary with dislocation structure subject to the constraint of Frank’s formula. In this constrained minimization problem, the objective function, i.e., the grain boundary energy, is nonconvex and separable, and the constraints are linear. To solve this constrained minimization problem, we modify the alternating direction method of multipliers (ADMM) with an increasing penalty parameter. We provide a convergence analysis of the modified ADMM in this nonconvex minimization problem, with settings not considered by the existing ADMM convergence studies. Specifically, in the linear constraints, the coefficient matrix of each subvariable block is of full column rank. This property makes each subvariable minimization strongly convex if the penalty parameter is large enough, and contributes to the convergence of ADMM without any convex assumption on the entire objective function. We prove that the limit of the sequence from the modified ADMM is primal feasible and is the stationary point of the augmented Lagrangian function. Furthermore, we obtain sufficient conditions to show that the objective function is quasi-convex and thus it has a unique minimum over the given domain. Numerical examples are presented to validate the convergence of the algorithm, and results of the penalty method, the augmented Lagrangian method, and the modified ADMM are compared.
Förderung
- Hong Kong Research Grants Council General Research Fund
- Hong Kong Research Grants Council Collaborative Research Fund
- Project of Hetao Shenzhen-HKUST Innovation Cooperation Zone
- National Natural Science Foundation of China
- Shenzhen Science and Technology Innovation Program
- Research Team Cultivation Program of Shenzhen University
Zitieren
APA
Wu, Y., Zhang, L., & Xiang, Y. (2026). A Convergent ADMM Algorithm for Grain Boundary Energy Minimization. Journal of Scientific Computing, 108(3). https://doi.org/10.1007/s10915-026-03410-9
Vancouver
Wu Y, Zhang L, Xiang Y. A Convergent ADMM Algorithm for Grain Boundary Energy Minimization. Journal of Scientific Computing. 2026;108(3). doi:10.1007/s10915-026-03410-9
BibTeX
@article{Wu2026,
author = {Wu, Yue and Zhang, Luchan and Xiang, Yang},
title = {A Convergent ADMM Algorithm for Grain Boundary Energy Minimization},
journal = {Journal of Scientific Computing},
year = {2026},
volume = {108},
number = {3},
doi = {10.1007/s10915-026-03410-9}
}
EUVIMED