Asynchronous iterative algorithms with flexible communication for nonlinear network flow problems

Journal of Parallel and Distributed Computing

Volumn 38, Issue 1, 1996, Pages 1-15

  El Baz, Didier ^a   Spiteri, Pierre ^b   Miellou, Jean Claude ^c   Gazen, Didier ^a  

^a LAAS CNRS   (France)

^b IRIT   (France)

^c UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039191092     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0124     Document Type: Article

References (43)

1. [Bau78] G. M. Baudet, Asynchronous iterative methods for multiprocessors. J. Assoc. Comput. Mach. 2 (1978), 226-244.
2. [Ber82] D. P. Bertsekas, Distributed dynamic programming. IEEE Trans. Automat. Control AC-27 (1982), 610-616.
3. [Ber83] D. P. Bertsekas, Distributed asynchronous computation of fixed points. Math. Programming 27 (1983), 107-120.
4. [BeC90] D. P. Bertsekas and D. A. Castañon, Parallel asynchronous primal-dual methods for the minimum cost flow problem. Report LIDS-P-1998, Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA, 1990.
5. [BeC91] D. P. Bertsekas and D. A. Castañon, Parallel synchronous and asynchronous implementation of the auction algorithm. Parallel Comput. 17 (1991), 707-732.
6. [BCE95] D. P. Bertsekas, D. A. Castañon, J. Eckstein, and S. Zenios, Parallel computing in optimization. In M. O. Bal et al., Eds. Handbooks in Operation Research and Management Science. Elsevier, New York, 1995, Vol. 7, pp. 331-339.
7. [BeE87] D. P. Bertsekas and D. El Baz, Distributed asynchronous relaxation methods for convex network flow problems. SIAM J. Control Optim. 25 (1987), 74-85.
8. [BeT89] D. P. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation, Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ, 1989.
9. [BHT87] D. P. Bertsekas, P. Hossein, and P. Tseng, Relaxation methods for network flow problems with convex arc costs. SIAM J. Control Optim. 25 (1987), 1219-1243.
10. [BiD65] G. Birkhoff and J. B. Diaz, Nonlinear network problems. Quart. Appl. Math. 13 (1965), 431-443.
11. [ChM69] D. Chazan and W. Miranker, Chaotic relaxation. Linear Algebra Appl. 2 (1969), 199-222.
12. [ChZ91] E. Chajakis and S. A. Zenios, Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization. Parallel Comput. 17 (1991), 873-894.
13. [Elb90] D. El Baz, M-functions and parallel asynchronous algorithms. SIAM J. Numer. Anal. 27 (1990), 136-140.
14. [Elb91] D. El Baz, Asynchronous iterative algorithms for convex network flow problems. Proceedings of the European Control Conference, Grenoble, France, 1991, pp. 2397-2402.
15. [Elb93] D. El Baz, Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems. Parallel Comput. 19 (1993), 1019-1028.
16. [Elb94a] D. El Baz, Nonlinear systems of equations and parallel asynchronous iterative algorithms. In Joubert et al., Eds. Advances in Parallel Computing, Vol. 9, Parallel Computing Trends and Applications. North-Holland, Amsterdam, 1994, pp. 89-96.
17. [Elb94b] D. El Baz, Parallel iterative algorithms for the solution of Markov systems. In Proceedings of the 33rd IEEE Conference on Decision and Control, Lake Buena Vista, FL, Dec. 1994, pp. 2524-2527.
18. [Elb96] D. El Baz, Asynchronous gradient algorithms for a class of convex separable network flow problems. Comput. Optim. Appl. 5 (1996), 187-205.
19. [Elt82] M. N. El Tarazi, Some convergence results for asynchronous algorithms. Numer. Math. 39 (1982), 325-340.
20. [Elt84] M. N. El Tarazi, Algorithmes mixtes asynchrones, etude de la convergence monotone. Numer. Math. 44 (1984), 363-369.
21. [GiS91] L. Giraud, P. Spiteri, Résolution parallèle de problèmes aux limites non linéaires. MMAN 25 (1991), 579-606.
22. [LB87] S. Li and T. Basar, Asymptotic agreement and convergence of asynchronous stochastic algorithms. IEEE Trans. Automat. Control AC-32 (1987), 612-618.
23. [Mie75a] J. C. Miellou, Algorithmes de relaxation chaotique à retards. RAIRO R1 (1975), 55-82.
24. [Mie75b] J. C. Miellou, Itérations chaotiques à retards, étude de la convergence dans le cas d'espaces partiellement ordonnés. C.R.A.S. Paris 280 (1975), 233-236.
25. [Mie86] J. C. Miellou, Asynchronous iterations and order intervals, In M. Cosnard, Ed. Parallel Algorithms and Architectures. North-Holland, Amsterdam, 1986, pp. 85-96.
26. [MCB90] J. C. Miellou, Ph. Cortey-Dumont, and M. Boulbrachêne, Perturbation of fixed point iterative methods. Adv. Parallel Comput. 1 (1990), 81-122.
27. [MES94] J. C. Miellou, D. El Baz, P. Spiteri, A new class of asynchronous iterative algorithms with order intervals. LCS/LAAS/IRIT Report 1994-16 (1994).
28. [MiS85a] J. C. Miellou, P. Spiteri, Two criteria for the convergence of asynchronous iterations. In P. Chenin, C. di Crescenzo, and F. Robert, Eds. Computers and Computing. Wiley-Masson, Paris, 1985, pp. 91-95.
29. [MiS85b] J. C. Miellou, P. Spiteri, Un critère de convergence pour des méthodes générales de point fixe. MMAN 19 (1985), 645-669.
30. [OrR70] J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
31. [Por69] T. A. Porshing, Jacobi and Gauss-Seidel methods for nonlinear network problems. SIAM J. Numer. Anal. 6 (1969), 437-449.
32. [Rhe70] W. C. Rheinboldt, On M-functions and their application to non-linear Gauss-Seidel iterations and to network flows. J. Math. Anal. App. 32 (1970), 274-307.
33. [Roc70] R. T. Rockafellar, Convex Analysis. Princeton Univ. Press, Princeton NJ, 1970.
34. [Roc84] R. T. Rockafellar, Network Flows and Monotropic Optimization. Wiley, New York, 1984.
35. [SME95] P. Spiteri, J. C. Miellou, and D. El Baz, Asynchronous alternating Schwarz method for the solution of nonlinear partial differential equations. IRIT/LCS/LAAS report 95-17-R 1995.
36. [TsB86] J. N. Tsitsiklis and D. P. Bertsekas, Distributed asynchronous optimal routing in data networks. IEEE Trans. Automat. Control AC-31 (1986), 325-332.
37. [TsB87] P. Tseng and D. P. Bertsekas, Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Programming 38 (1987), 303-321.
38. [TBA86] J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Automat. Control AC-31 (1986), 803-812.
39. [TBT90] P. Tseng, D. P. Bertsekas, and J. N. Tsitsiklis, Partially asynchronous parallel algorithms for network flow and other problems. SIAM J. Control Optim. 28 (1990), 678-710.
40. [Tse90] P. Tseng, Dual coordinate ascent for problems with strictly convex costs and linear constraints, a unified approach. SIAM J. Control Optim. 28 (1990), 214-242.
41. [UrD90] A. Uresin and M. Dubois, Sufficient conditions for the convergence of asynchronous iterations. Parallel Comput. 10 (1989), 83-92.
42. [ZeL88] S. Zenios and R. Lasken, The Connection Machines CM-1 and CM-2: Solving nonlinear network problems. International Conference on Supercomputing, St. Malo, France, 1988, pp. 648-658.
43. [ZeM88] S. Zenios and J. Mulvey, A distributed algorithm for convex network optimization problems. Parallel Comput. 6 (1988), 45-56.