NUMERICAL STUDIES OF SOME GENERALIZED CONTROLLED RANDOM SEARCH ALGORITHMS

DOI10.1142/S0217595912500169zbMath1246.90123OpenAlexW2099264477WikidataQ57931958 ScholiaQ57931958MaRDI QIDQ2911580

No author found.

Publication date: 31 August 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595912500169

zbMATH Keywords

global optimizationlinear interpolationDIRECT algorithmcontrolled random searchprobabilistic adaptation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Search theory (90B40)

Cites Work

• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Some variants of the controlled random search algorithm for global optimization
• Global optimization algorithms for a CAD workstation
• Global optimization by controlled random search
• Stochastic global optimization: Problem classes and solution techniques
• Lipschitzian optimization without the Lipschitz constant
• A new version of the Price's algorithm for global optimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A numerical comparison of some modified controlled random search algorithms
• Application of stochastic global optimization algorithms to practical problems
• A note on the Griewank test function
• Population set-based global optimization algorithms: some modifications and numerical studies
• Numerical Optimization
• A Simplex Method for Function Minimization
• Wedge trust region method for derivative free optimization.

This page was built for publication: NUMERICAL STUDIES OF SOME GENERALIZED CONTROLLED RANDOM SEARCH ALGORITHMS