Some Saddle-function splitting methods for convex programming
Jonathan Eckstein · Optimization methods & software · 1994
Consider two variations of the method of multipliers, or classical augmented Lagrangian method for convex programming. The proximal method of multipliers adjoins quadratic primal proximal terms to the augmented Lagrangian, and has a stronger primal convergence theory than the standard method. On the other hand, the alternating direction method of multipliers, which uses a special kind of partial minimization of the augmented Lagrangian, is conducive to the derivation of decomposition methods finding application in parallel computing. This note shows convergence a method combining the features of these two variations. The method is closely related to some algorithms of Gols'shtein. A comparison of the methods helps illustrate the close relationship between previously separate bodies of Western and Soviet literature.
Cited by 139 works. doi:10.1080/10556789408805578
Authors
References
- Convex Analysis
- Parallel and Distributed Computation: Numerical Methods
- Constrained Optimization and Lagrange Multiplier Methods
- Monotone Operators and the Proximal Point Algorithm
- Operateurs Maximaux Monotones - Et Semi-Groupes De Contractions Dans Les Espaces De Hilbert
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of the method of partial inverses to convex programming: Decomposition