Convergence qualification of adaptive partition algorithms in global optimization (Q1196187): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: János D. Pintér / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Karel Zimmermann / rank
 
Normal rank

Revision as of 11:29, 10 February 2024

scientific article
Language Label Description Also known as
English
Convergence qualification of adaptive partition algorithms in global optimization
scientific article

    Statements

    Convergence qualification of adaptive partition algorithms in global optimization (English)
    0 references
    17 December 1992
    0 references
    The author considers the optimization problem \(\min f(x)\), subject to \(x\in M\), where \(M\) is a bounded set, which is a closure of a non-empty open set of the real Euclidean \(n\)-space. The objective function \(f\) is continuous and may be multiextremal on \(M\). A general class of methods solving this problem via ``complete'' partition and search of \(M\) is investigated. Necessary and sufficient convergence conditions are formulated.
    0 references
    multiextremal optimization
    0 references
    adaptive partition strategies
    0 references
    necessary and sufficient convergence conditions
    0 references
    0 references

    Identifiers