𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the global optimization properties of finite-difference local descent algorithms

✍ Scribed by S. K. Zavriev

Publisher
Springer US
Year
1993
Tongue
English
Weight
442 KB
Volume
3
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the global stabilization of locally c
On the global stabilization of locally convergent algorithms
✍ E. Polak πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 476 KB

It is possible to summarize the schemes, used in the past to stabilize algorithms, in the form of algorithm models. These models serve as patterns for subsequent applications. Summm'y--There are a number of algorithms in the literature which both theoretically and empirically are known to be only l

Effect of the subdivision strategy on co
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
✍ Hoang Tuy πŸ“‚ Article πŸ“… 1991 πŸ› Springer US 🌐 English βš– 874 KB

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

Optimal estimation on the order of local
Optimal estimation on the order of local testability of finite automata
✍ A.N. Trahtman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 141 KB

A locally testable language L is a language with the property that for some nonnegative integer k, called the order of local testability, whether or not a word u is in the language L depends on (1) the preΓΏx and su x of the word u of length k -1 and (2) the set of subwords of length k of the word u.