A global optimization algorithm using adaptive random search
From MaRDI portal
Publication:1148232
Cites work
- scientific article; zbMATH DE number 3545325 (Why is no real title available?)
- A Comparative Evaluation of Two Global Search Algorithms
- A method of unconstrained global optimization
- An Adaptive Random Search Algorithm for Constrained Minimization
- Convergence of the random search method in the presence of noise
- Expanding subinterval random search for system identification and control
- On the Convergence of Random Search Algorithms In Continuous Time with Applications to Adaptive Control
- On the Convergence of Statistical Search
- Random optimization
Cited in
(14)- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- DYNAMIC PROGRAMMING FOR OPTIMALITY IDENTIFICATION OF PRODUCTION SYSTEMS
- Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem
- A direct stochastic algorithm for global search
- A review on computational intelligence for identification of nonlinear dynamical systems
- A modified convergence theorem for a random optimization method
- Comparison of modeling approaches for full-scale nonlinear viscous dampers
- Adaptive stochastic optimization using multiprocessors
- Generation of random sequences with jointly specified probability density and autocorrelation functions
- Apply a novel evolutionary algorithm to the solution of parameter selection problems
- Optimal and sustainable management of a soilborne banana pest
- Optimization of econometric dynamic systems
- Solving the unconstrained optimization problem by a variable neighborhood search
This page was built for publication: A global optimization algorithm using adaptive random search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148232)
