most citedA rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 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…