Alternating direction splittings for block angular parallel optimization
From MaRDI portal
Publication:2564997
DOI10.1007/BF02192243zbMath0866.90095MaRDI QIDQ2564997
Renato De Leone, Robert R. Meyer, Spyridon Kontogiorgis
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
decomposition algorithms; parallel computation; augmented Lagrangian; alternating directions method; block angular structure; large-scale multicommodity flow
65K05: Numerical mathematical programming methods
90C25: Convex programming
90B10: Deterministic network models in operations research
65Y05: Parallel numerical computation
Related Items
Interior-point Lagrangian decomposition method for separable convex optimization, A variable-penalty alternating directions method for convex optimization, An alternating direction method for solving convex nonlinear semidefinite programming problems
Uses Software
Cites Work
- Unnamed Item
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A diagonal quadratic approximation method for large scale linear programs
- Application of the alternating direction method of multipliers to separable convex programming problems
- On the method of multipliers for mathematical programming problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Decomposition Principle for Linear Programs
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Solving multistage stochastic networks: An application of scenario aggregation
- An Interior Point Method for Block Angular Optimization
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- Coordination in Coarse-Grained Decomposition
- Parallel Variable Distribution
