Alternating direction method

We propose LADM with parallel splitting and adaptive penalty (LADMPSAP) to solve multi-block separable convex programs efficiently. We further propose a simple optimality measure and reveal the convergence rate of LADMPSAP in an ergodic sense.

We propose a linearized alternating direction method with adaptive penalty for solving subproblems in ADM conveniently