Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (Q5470225): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 829 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Global Optimization Toolbox For Maple / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962898795 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1103.2056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:24, 20 April 2024

scientific article; zbMATH DE number 5029002
Language Label Description Also known as
English
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
scientific article; zbMATH DE number 5029002

    Statements

    Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (English)
    0 references
    0 references
    30 May 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    black-box functions
    0 references
    derivative free methods
    0 references
    diagonal partitions
    0 references
    Lipschitz optimization problem
    0 references
    algorithm
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references