Application of the alternating direction method of multipliers to separable convex programming problems
- 1 October 1992
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 1 (1) , 93-111
- https://doi.org/10.1007/bf00247655
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational InequalitiesSIAM Journal on Control and Optimization, 1991
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programmingMathematical Programming, 1990
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified ApproachSIAM Journal on Control and Optimization, 1990
- Applications of the method of partial inverses to convex programming: DecompositionMathematical Programming, 1985
- Partial inverse of a monotone operatorApplied Mathematics & Optimization, 1983
- Chapter III On Decomposition-Coordination Methods Using an Augmented LagrangianPublished by Elsevier ,1983
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970