Discrete backtracking adaptive search for global optimization

DOI10.1007/0-306-47648-7_9zbMATH Open1211.90185OpenAlexW2202245962MaRDI QIDQ2999083FDOQ2999083

Authors: Birna P. Kristinsdottir, Zelda B. Zabinsky, Graham R. Wood 

Publication date: 11 May 2011

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-306-47648-7_9

Recommendations

• Pure adaptive search in global optimization
• Stochastic adaptive search for global optimization.
• Analysis and parameter selection for an adaptive random search algorithm
• Randomized algorithm for global optimization with bounded memory
• scientific article; zbMATH DE number 3920191

zbMATH Keywords

simulated annealingglobal optimizationadaptive searchrandom search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Cited In (1)

• Pure adaptive search for finite global optimization

This page was built for publication: Discrete backtracking adaptive search for global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999083)