Multidimensional bisection: the performance and the context (Q686996): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Iterative Methods for the Localization of the Global Maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the global maximum of a multimodal, multivariate function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates of a global optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of global methods in multiextremal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the absolute extremum of a function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Method Seeking the Global Maximum of a Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional bisection applied to global optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bisection method in higher dimensions / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01096775 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015240108 / rank
 
Normal rank

Latest revision as of 10:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Multidimensional bisection: the performance and the context
scientific article

    Statements

    Multidimensional bisection: the performance and the context (English)
    0 references
    0 references
    0 references
    0 references
    13 October 1993
    0 references
    multidimensional bisection algorithms
    0 references
    Lipschitz continuous functions
    0 references
    deepest point algorithm
    0 references
    branch and bound
    0 references
    covers
    0 references
    localisations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references