Nongradient minimization methods for parallel processing computers, part 1
- 49 Downloads
This paper attempts to provide minimization algorithms which are adapted to execution on parallel computers. For this purpose, three well-known nongradient methods are examined. From these, three parallel iterative procedures are derived, by discussing in detail their mathematical behavior, when the cooperating processes are either synchronous or asynchronous.
Key WordsParallel algorithms unconstrained optimization nongradient methods
Unable to display preview. Download preview PDF.
- 1.Baudet, G. M.,Asynchronous Iterative Methods for Multiprocessors, Journal of the Association for Computing Machinery, Vol. 25, No. 2, 1978.Google Scholar
- 2.Chazan, D., andMiranker, W. L.,A Nongradient and Parallel Algorithm for Unconstrained Minimization, SIAM Journal on Control, Vol. 8, No. 2, 1970.Google Scholar
- 3.Cavalli, E.,Algoritmi Paralleli: Una Rassegna, Consiglio Nazionale delle Ricerche, Istituto per le Applicazioni del Calcolo, Quaderno No. 40, Serie 3, Roma, Italy, 1977.Google Scholar
- 4.Sloboda, F.,A Conjugate Direction Method and Its Application, Proceedings of the 8th IFIP Conference on Optimization Techniques, Wurzburg, Springer-Verlag, 1977.Google Scholar
- 5.Sutti, C.,A New Method for Unconstrained Minimization without Derivatives, Toward Global Optimization-1, Edited by L. C. W. Dixon and G. P. Szegö, North Holland, Amsterdam, Holland, 1975.Google Scholar
- 6.Sutti, C.,Numerical Experiences on a Minimization Algorithm without Derivatives, Toward Global Optimization-2, Edited by L. C. W. Dixon and G. P. Szegö, North Holland, Amsterdam, Holland, 1978.Google Scholar
- 7.Sutti, C.,Convergence Proof of Minimization Algorithms for Nonconvex Functions, Journal of Optimization Theory and Applications, Vol. 23, No. 2, 1977.Google Scholar