Comparison of independent, stratified and random covering sample schemes in optimization problems (Q1921106): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5732992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4064914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering space with convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical inference for bounds of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the endpoint of a distribution / rank
 
Normal rank

Latest revision as of 14:01, 24 May 2024

scientific article
Language Label Description Also known as
English
Comparison of independent, stratified and random covering sample schemes in optimization problems
scientific article

    Statements

    Comparison of independent, stratified and random covering sample schemes in optimization problems (English)
    0 references
    0 references
    0 references
    11 March 1997
    0 references
    The authors consider three schemes of global optimization algorithms based on the use of grids. They compare the so-called independent sampling, stratified sampling and random covering grids implemented to the estimation problem of the global maximum of a function. The results give an insight on how a decrease of randomness in selection rules for the trial points improves efficiency of global random search algorithms.
    0 references
    0 references
    uniform grid
    0 references
    global optimization algorithms
    0 references
    stratified sampling
    0 references
    global random search algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references