A Parallel Splitting Augmented Lagrangian Method for Two-Block Separable Convex Programming with Application in Image Processing

Abstract EN

The augmented Lagrangian method (ALM) is one of the most successful first-order methods for convex programming with linear equality constraints.

To solve the two-block separable convex minimization problem, we always use the parallel splitting ALM method.

In this paper, we will show that no matter how small the step size and the penalty parameter are, the convergence of the parallel splitting ALM is not guaranteed.

We propose a new convergent parallel splitting ALM (PSALM), which is the regularizing ALM’s minimization subproblem by some simple proximal terms.

In application this new PSALM is used to solve video background extraction problems and our numerical results indicate that this new PSALM is efficient.