A primal-dual proximal point algorithm for constrained convex programs
The author proposes a mixed proximal multipliers method to solve convex constrained minimization problems. The proposed method resembles to the Bregman method of multipliers with a quadratic regularization of the augmented Lagrangian function.
scientific article; zbMATH DE number 2136171