A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572)

From MaRDI portal
Revision as of 10:48, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
scientific article

    Statements

    A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (English)
    0 references
    0 references
    2 November 2017
    0 references
    The paper proposes a method for solving a global optimization problem for a symmetric Lipschitz continuous function. The author shows that this problem always has a solution with natural conditions on the data. The proposed method is illustrated by solving a center-based clustering problem with synthetic data. Some numerical experiments are presented by testing the proposed method on the image segmentation problem.
    0 references
    symmetric function
    0 references
    Lipschitz continuous function
    0 references
    global optimization
    0 references
    DIRECT
    0 references
    SymDIRECT
    0 references
    DISIMPL
    0 references
    center-based clustering
    0 references
    numerical experiment
    0 references
    image segmentation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references