Global minimization algorithms for Hölder functions (Q1599138)

From MaRDI portal
Revision as of 11:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Global minimization algorithms for Hölder functions
scientific article

    Statements

    Global minimization algorithms for Hölder functions (English)
    0 references
    0 references
    23 January 2003
    0 references
    The one-dimensional global optimization problem \(\min\{f(x):x\in [a,b]\}\) is considered where the function \(f(x)\) satisfies the Hölder condition \(|f(x)- f(y)|\leq h|x-y|^{1/N}\). A new scheme for the method of \textit{S. A. Piyavskij} [U.S.S.R. Comput Math. Math. Phys. 12(1972), No. 4, 57-67 (1973; Zbl 0282.65052)] is proposed and three algorithms are given. Numerical tests are presented.
    0 references
    0 references
    numerical examples
    0 references
    Piyavskij method
    0 references
    global optimization
    0 references
    algorithm
    0 references
    0 references
    0 references

    Identifiers