Applications of interval arithmetic in non-smooth global optimization (Q1405071)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Applications of interval arithmetic in non-smooth global optimization
scientific article

    Statements

    Applications of interval arithmetic in non-smooth global optimization (English)
    0 references
    25 August 2003
    0 references
    An expansion scheme for nonlinear, at least continuous functions \(f: D\subset\mathbb{R}^n\to \mathbb{R}\) is presented with which one can provide enclosures of the range of \(f\). The scheme uses real compact intervals and slopes. It is applied in a branch-and-bound algorithm in global optimization in order to enclose the global minimum \(f^*= \min_{x\in X^0} f(x)\) on a given interval box \(X^0\subseteq D\) and to enclose the corresponding minimum points. The algorithm employs also a special pruning test to cut away obsolute subboxes which have been proved not to contain a minimum point. A variety of examples illustrates the efficiency of the algorithm followed by some concluding remarks.
    0 references
    0 references
    global optimization
    0 references
    non-smooth function
    0 references
    branch-and-bound algorithm
    0 references
    interval arithmetic
    0 references
    numerical examples
    0 references
    slopes
    0 references
    global minimum
    0 references
    minimum points
    0 references
    pruning test
    0 references
    0 references
    0 references
    0 references

    Identifiers

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