Branch and bound algorithms for maximizing expected improvement functions (Q710752): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: EGO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121437933 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1003.0804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of global optimization methods based on response surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient global optimization of expensive black-box functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization to prescribed accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of computer experiments. With comments and a rejoinder by the authors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and analysis of computer experiments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the design of optimization strategies based on global response surface approximation models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation of spatial data. Some theory for kriging / rank
 
Normal rank
Property / cites work
 
Property / cites work: An informational approach to the global optimization of expensive-to-evaluate functions / rank
 
Normal rank

Latest revision as of 09:22, 3 July 2024

scientific article
Language Label Description Also known as
English
Branch and bound algorithms for maximizing expected improvement functions
scientific article

    Statements

    Branch and bound algorithms for maximizing expected improvement functions (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computer experiments
    0 references
    feature estimation
    0 references
    0 references
    0 references