Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization
✍ Scribed by B. Betrò; F. Schoen
- Publisher
- Springer-Verlag
- Year
- 1992
- Tongue
- English
- Weight
- 769 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For estimating the states or outputs of a Markov process, the symbol-by-symbol maximum a posteriori (MAP) algorithm is optimal. However, this algorithm, even in its recursive form, poses technical difficulties because of numerical representation problems, the necessity of non-linear functions and a
The unconstrained global programming problem is addressed using a multistart, multialgorithm infrastructure, in which different algorithms compete in parallel for a contribution towards a single global stopping criterion, denoted the unified Bayesian global stopping criterion. The use of different