A heuristic approach for finding the global minimum: Adaptive random search technique (Q2489483): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040061045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified convergence theorem for a random optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization by Random Search Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001920 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:19, 24 June 2024

scientific article
Language Label Description Also known as
English
A heuristic approach for finding the global minimum: Adaptive random search technique
scientific article

    Statements

    A heuristic approach for finding the global minimum: Adaptive random search technique (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    Random search technique
    0 references
    Global minimum
    0 references
    Random optimization
    0 references
    ARSET
    0 references
    Numerical examples
    0 references
    Algorithm
    0 references
    Artificial neural network
    0 references
    XOR problem
    0 references
    0 references