Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of global optimization methods for the design of a high-speed civil transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision Direction Selection in Interval Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cubic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for multivariate functions with Lipschitzian first derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully‐distributed parallel global search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bisection method in higher dimensions / rank
 
Normal rank

Latest revision as of 10:47, 10 June 2024

scientific article
Language Label Description Also known as
English
Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
scientific article

    Statements

    Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (English)
    0 references
    24 May 2005
    0 references
    Partitioning
    0 references
    minimal description
    0 references
    one-point-based algorithms
    0 references
    global optimization
    0 references

    Identifiers