Abstract
In this paper we present parallel implementations of 2 classical optimization methods, namely the Quasi-Newton method for non-linear minimization and the Marquardt method for non-linear least squares problems. Both methods are iterative, and we discuss which parts of the computations in an iteration step are suited for parallel computations. We discuss the choice of configuration of the transputer network and present results of test runs of the implementations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
SGS-Thomson: occam 2.1 Toolset, SGS-Thomson (1995)
Tingleff, O.: Communication Harnesses for Transputer systems with Tree Structure and Cube Structure. In: Applied Parallel Computing, Dongara, J., Madsen, K. and Wasniewsky, J. (eds.), Springer 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tingleff, O. (1996). Parallel implementations of classical optimization methods. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_72
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive