The effect of perturbations on the convergence rates of optimization algorithms
β Scribed by J. C. Dunn; E. Sachs
- Publisher
- Springer
- Year
- 1983
- Tongue
- English
- Weight
- 664 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0095-4616
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exh