DIRECT algorithm: A new definition of potentially optimal hyperrectangles (Q849791): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2005.11.127 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.11.127 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012853842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally-biased form of the DIRECT algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization by multilevel coordinate search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2005.11.127 / rank
 
Normal rank

Latest revision as of 05:15, 10 December 2024

scientific article
Language Label Description Also known as
English
DIRECT algorithm: A new definition of potentially optimal hyperrectangles
scientific article

    Statements

    DIRECT algorithm: A new definition of potentially optimal hyperrectangles (English)
    0 references
    0 references
    31 October 2006
    0 references
    global optimization
    0 references
    DIRECT algorithm
    0 references
    two-point based sampling method
    0 references
    potentially optimal triangle
    0 references
    subdivision and sampling method
    0 references
    0 references
    0 references

    Identifiers