๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives

โœ Scribed by V.P. Gergel; Ya.D. Sergeyev


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
954 KB
Volume
37
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper, sequential and parallel algorithms using derivatives for solving unconstrained one-dimensional global optimization problems are described. Sufficient conditions of convergence to all global minimizers are established for both methods. Parallel algorithm conditions, which guarantee significant speed up in comparison to the sequential version of the method, are presented. The sequential method is numerically compared with the algorithms of Breiman and Cutler, Pijavskii, and Strongin on a set of 20 test functions taken from literature. We also present results of numerical experiments illustrating the performance of the parallel method. All experiments have been executed on the parallel computer ALLIANT FX/80. (~) 1999 Elsevier Science Ltd. All rights reserved.


๐Ÿ“œ SIMILAR VOLUMES


Algorithms for calculating excluded volu
โœ Craig E. Kundrot; Jay W. Ponder; Frederic M. Richards ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 713 KB

## Abstract A numerical method for calculating the volume of a macromolecule and its first and second derivatives as a function of atomic coordinates is presented. For __N__ atoms, the method requires about 0.3 __N__ ln(__N__) seconds of CPU time on a VAXโ€8800 to evaluate the volume and derivatives