Efficient computation of expected hypervolume improvement using box decomposition algorithms (Q2274866): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1329727
Created claim: Wikidata QID (P12): Q127574912, #quickstatements; #temporary_batch_1722424008430
 
(10 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: A. H. Deutz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: fminsearch / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMS-EMOA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Platypus / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2941114335 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1904.12672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17--21, 2011. Selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of the search region in multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multicriteria Generalization of Bayesian Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved quick hypervolume algorithm / 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: A box decomposition algorithm to compute the hypervolume indicator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global search method for optimizing nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing 3-D Expected Hypervolume Improvement and Related Integrals in Asymptotically Optimal Time / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127574912 / rank
 
Normal rank

Latest revision as of 12:07, 31 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of expected hypervolume improvement using box decomposition algorithms
scientific article

    Statements

    Efficient computation of expected hypervolume improvement using box decomposition algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 October 2019
    0 references
    expected hypervolume improvement
    0 references
    probability of improvement
    0 references
    time complexity
    0 references
    multi-objective Bayesian global optimization
    0 references
    hypervolume indicator
    0 references
    Kriging
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers