Parallel Constraint Distribution
Authors:
- M. C. FerrisMFM. C. Ferris
- O. L. MangasarianOMO. L. Mangasarian
- 1 November 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (4) , 487-500
Abstract
Constraints of a mathematical program are distributed among parallel processors together with an appropriately constructed augmented Lagrangian for each processor, which contains Lagrangian information on the constraints handled by the other processors. Lagrange multiplier information is then exchanged between processors. Convergence is established under suitable conditions for strongly convex quadratic programs and for general convex programs.Keywords
This publication has 14 references indexed in Scilit:
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity ProblemSIAM Journal on Control and Optimization, 1991
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity ProblemSIAM Journal on Optimization, 1991
- A Decomposition Method and Its Application to Convex ProgrammingMathematics of Operations Research, 1989
- A simple characterization of solution sets of convex programsOperations Research Letters, 1988
- Normal solutions of linear programs1984
- Iterative methods for variational and complementarity problemsMathematical Programming, 1982
- Nonlinear Perturbation of Linear ProgramsSIAM Journal on Control and Optimization, 1979
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex ProgrammingSIAM Journal on Control, 1974