Matching stochastic algorithms to objective function landscapes
DOI10.1007/S10898-004-9968-YzbMATH Open1093.90030OpenAlexW2001271185MaRDI QIDQ813359FDOQ813359
Authors: W. P. Baritompa, E. M. T. Hendrix, Mirjam Dür, Lyle Noakes, Graham R. Wood 
Publication date: 8 February 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-9968-y
Recommendations
- Algorithms for stochastic optimization with function or expectation constraints
- On benchmarking stochastic global optimization algorithms
- Methods to compare expensive stochastic optimization algorithms with random restarts
- scientific article; zbMATH DE number 1060031
- Criterion algorithms of stochastic optimization
- Stochastic comparison algorithm for continuous optimization with estimation
- A Stochastic Approximation Framework for a Class of Randomized Optimization Algorithms
- A stochastic algorithm for constrained global optimization
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Stochastic programming (90C15)
Cites Work
- Stochastic global optimization: Problem classes and solution techniques
- Handbook of global optimization. Vol. 2
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Stochastic techniques for global optimization: A survey of recent advances
- Simulated annealing for constrained global optimization
- On success rates for controlled random search
- Global optimization
- Improving hit-and-run for global optimization
- Bounds on absorption times of directionally biased random sequences
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Matching stochastic algorithms to objective function landscapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813359)
