A variable-penalty alternating directions method for convex optimization

Mathematical Programming, Series B

Volumn 83, Issue 1, 1998, Pages 29-53

  Kontogiorgis, Spyridon ^a   Meyer, Robert R ^b  

^a Operations Research   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

Alternating direction methods; Block angular programs; Decomposition; Parallel computing

Indexed keywords

EID: 0002202679     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02680549     Document Type: Article

References (46)

1. A.A. Assad, Multicommodity network flows: A survey, Networks 8 (1978) 37-91.
2. D.P. Bertsekas, Multiplier methods: A survey, Automatica 12 (1976) 133-145.
3. D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice Hall, Englewood Cliffs, NJ, 1989.
4. J. Bimberg, The Fermat-Weber location problem revisited, Mathematical Programming 71 (1995) 71-76.
5. J. Céa, Lectures on Optimization - Theory and Algorithms, Lectures on Mathematics and Physics, vol.53, Springer, Berlin, 1978.
6. G. Cheng, M. Teboulle, A proximal-based decomposition method for convex minimization problems, Mathematical Programming, Series A 64 (1994) 81-110.
7. Y.C. Cheng, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, Journal of Optimization Theory and Applications 43 (1984) 527-541.
8. G. Cohen, D.L. Zhu, Decomposition coordination methods in large scale optimization problems: The nondifferentiable case and the case of augmented lagrangians, in: J.B. Cruz (Ed.), Advances in Large Scale Systems Theory and Applications, JAI Press, Greenwich, CT, 1983, pp. 203-266.
9. J. Douglas, H.H. Rachford, Jr., On the numerical solution of heat conduction problems in two- and three-space variables, Transactions of the American Mathematical Society 82 (1956) 421-439.
10. J. Eckstein, Splitting Methods for Monotone Operators with Applications to Parallel Optimization. Ph.D. Thesis, Massachusetts Institute of Technology, Department of Civil Engineering, Technical Report LIDS-TH-1877, MIT, 1989.
11. J. Eckstein, The alternating step method for monotropic programming on the Connection Machine CM-2, ORSA Journal on Computing 5 (1993) 293-318.
12. J. Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Mathematics of Operations Research 18 (1993) 202-226.
13. J. Eckstein, D.P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point method for maximal monotone operators, Mathematical Programming, Series A 55 (1992) 293-318.
14. J. Eckstein, M. Ferris, Operator splitting methods for monotone linear complementarity problems, Technical Report TMC-239, Thinking Machines Corporation, Cambridge, Massachusetts, 1992.
15. J. Eckstein, M. Fukushima, Some reformulations and applications of the alternating direction method of multipliers, in: W.W. Hager, D.W. Hearn, P.M. Pardalos (Eds.), Large Scale Optimization: State of the Art, Kluwer Academic Publishers, Dordrecht, 1994, pp. 115-134.
16. W. Findeisen, F.N. Bailey, M. Brdyś, K. Malinowski, P. Tatjewski, A. Woźniak, Control and Coordination in Hierarchical Systems, Wiley, New York, 1980.
17. M. Fortin, R, Glowinski (Eds.), Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, North-Holland, Amsterdam, 1983.
18. M. Fukushima, Application of the alternating direction method of multipliers to separable convex programming problems, Computational Optimization and Applications 1 (1992) 93-111.
19. D. Gabay, Applications of the method of multipliers to variational inequalities, in: M. Fortin, R. Glowinski (Eds.), Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Valued Problems, North-Holland, Amsterdam, 1983, pp. 299-331.
20. D. Gabay, B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Computers and Mathematics with Applications 2 (1976) 17-40.
21. R. Glowinski, P. Le Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, SIAM, Philadelphia, PA, 1989.
22. Ye.G. Golshtein, The block method of convex programming, Soviet Mathematics Doklady 33 (1986) 584-587.
23. Ye.G. Golshtein, A general approach to decomposition of optimization systems, Soviet Journal of Computer and Systems Sciences 25 (1987) 105-114.
24. G.H. Golub, C.F. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
25. S. P. Han, G. Lou, A parallel algorithm for a class of convex problems, SIAM Journal on Control and Optimization 26 (1988) 345-355.
26. P. Henrici, Elements of Numerical Analysis, Wiley, New York, 1966.
27. M. Hestenes, Multiplier and gradient methods, Journal of Optimization Theory and Applications 4 (1969) 303-320.
28. R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1993.
29. P.V. Kamesam, R.R. Meyer, Multipoint methods for separable nonlinear networks, Mathematical Programming Study 22 (1984) 185-205.
30. C.Y. Kao, R.R. Meyer, Secant approximation methods for convex optimization, Mathematical Programming Study 14 (1981) 143-162.
31. S. Kontogiorgis, Alternating Directions Methods for the Parallel Solution of Large-Scale Block-Structured Optimization Problems, Ph.D. Thesis, University of Wisconsin-Madison, Department of Computer Sciences, Report MP 1994-13.
32. S. Kontogiorgis, R. De Leone, R.R. Meyer, Alternating direction splittings for block angular parallel optimization, Journal of Optimization Theory and Applications 90 (1996) 1-23.
33. P.L. Lions, B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM Journal on Numerical Analysis 16 (1979) 964-979.
34. J.M. Mulvey, A. Ruszczyński, A diagonal quadratic approximation method for large scale linear programs, Operations Research Letters 12 (1992) 205-215.
35. J.M. Mulvey, H. Vladimirou, Solving multistage stochastic networks: An application of scenario aggregation, Networks 21 (1990) 619-643.
36. L.M. Ostresh, Jr., On the convergence of a class of iterative methods for solving the Weber location problem, Operations Research 26 (1978) 597-609.
37. D.W. Peaceman, H.H. Rachford, Jr., The numerical solution of parabolic and elliptic differential equations, SIAM Journal 3 (1955) 28-42.
38. B.T. Polyak, Introduction to Optimization, Optimization Software, Inc., 1987.
39. M.J.D. Powell, A method for nonlinear constraints in minimization problems, in: R. Fletcher (Ed.), Optimization, Academic Press, New York, 1969, pp. 283-298.
40. R.T. Rockafellar, The multiplier method of Hestenes and Powell applied to convex programming, Journal of Optimization Theory and Applications 12 (1973) 555-562.
41. R.T. Rockafellar, Augmented lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97-116.
42. R.T. Rockafellar, R.J.-B. Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of Operations Research 16 (1991) 119-147.
43. J.E. Spingarn, Partial inverse of a monotone operator, Applied Mathematics and Optimization 10 (1983) 247-265.
44. J.E. Spingarn, Applications of the method of partial inverses to convex programming: Decomposition, Mathematical Programming 32 (1985) 199-223.
45. G. Stephanopoulos, A.W. Westerberg, The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization, Journal of Optimization Theory and Applications 15 (1975) 285-309.
46. P. Tseng, D.P. Bertsekas, On the convergence of the exponential multiplier method for convex programming, Mathematical Programming 60 (1993) 1-19.