3 citations · 6 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022★ 1 cited
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
Bingsheng He, Feng Ma, Shengjie Xu +1
The augmented Lagrangian method (ALM) is classic for canonical convex programming problems with linear constraints, and it finds many applications in various scientific computing a…
math.OC2022★ 2 cited
On construction of splitting contraction algorithms in a prediction-correction framework for separable convex optimization
Bingsheng He, Xiaoming Yuan
In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of mul…