Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in $(0,2)$ for separable convex programming
HTML articles powered by AMS MathViewer

by Bingsheng He, Feng Ma, Shengjie Xu and Xiaoming Yuan HTML | PDF
Math. Comp. 92 (2023), 1633-1663 Request permission


The augmented Lagrangian method (ALM) is classic for canonical convex programming problems with linear constraints, and it finds many applications in various scientific computing areas. A major advantage of the ALM is that the step for updating the dual variable can be further relaxed with a step size in $(0,2)$, and this advantage can easily lead to numerical acceleration for the ALM. When a separable convex programming problem is discussed and a corresponding splitting version of the classic ALM is considered, convergence may not be guaranteed and thus it is seemingly impossible that a step size in $(0,2)$ can be carried on to the relaxation step for updating the dual variable. We show that for a parallel splitting version of the ALM, a step size in $(0,2)$ can be maintained for further relaxing both the primal and dual variables if the relaxation step is simply corrected by a rank-two matrix. Hence, a rank-two relaxed parallel splitting version of the ALM with a step size in $(0,2)$ is proposed for separable convex programming problems. We validate that the new algorithm can numerically outperform existing algorithms of the same kind significantly by testing some applications.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 90C25, 90C30, 90C33
  • Retrieve articles in all journals with MSC (2020): 90C25, 90C30, 90C33
Additional Information
  • Bingsheng He
  • Affiliation: Department of Mathematics, Nanjing University, People’s Republic of China
  • MR Author ID: 263678
  • Email:
  • Feng Ma
  • Affiliation: High-Tech Institute of Xi’an, Xi’an, 710025 Shaanxi, People’s Republic of China
  • ORCID: 0000-0002-8047-426X
  • Email:
  • Shengjie Xu
  • Affiliation: Department of Mathematics, Harbin Institute of Technology, Harbin, People’s Republic of China; and Department of Mathematics, Southern University of Science and Technology, Shenzhen, People’s Republic of China
  • MR Author ID: 1474980
  • Email:
  • Xiaoming Yuan
  • Affiliation: Department of Mathematics, The University of Hong Kong, Hong Kong
  • MR Author ID: 729439
  • Email:
  • Received by editor(s): May 10, 2022
  • Received by editor(s) in revised form: November 30, 2022
  • Published electronically: February 28, 2023
  • Additional Notes: The first author was supported by the NSFC Grant 11871029. The second author was supported by the NSFC Grant 12171481. The third author was supported by the NSFC Grant 11871264. The fourth author was supported by a URC Supplementary Funding for Faculties/Units of Assessment from HKU
  • © Copyright 2023 American Mathematical Society
  • Journal: Math. Comp. 92 (2023), 1633-1663
  • MSC (2020): Primary 90C25, 90C30, 90C33
  • DOI:
  • MathSciNet review: 4570336