An efficient augmented Lagrangian method with applications to total variation minimization

An algorithm for solving a class of equality-constrained non-smooth optimization problems (chiefly but not necessarily convex programs) with a particular structure that effectively combines an alternating direction technique with a nonmonotone line search to minimize the augmented Lagrangian function at each iteration is proposed.