On Uniform Covering, Adaptive Random Search and Raspberries

Authors:
Eligius M. T. Hendrix;Olivier Klepper
Affiliations:
Department of Mathematics , Agricultural University Wageningen , Dreijenlaan 4, 6703 HA, Wageningen, The Netherlands (e-mail : eligius@rcl.wau.nl );Sterpolis Insurance, P.O. Box 9225, 6800 KG, Arnhem, The Netherlands
Venue:
Journal of Global Optimization
Year:
2000

Citing 6
Cited 7

Computational experience with confidence intervals for nonlinear least squares

Technometrics
Pure adaptive search in Monte Carlo optimization

Mathematical Programming: Series A and B
Estimation of parameter bounds from bounded-error data: a survey

Mathematics and Computers in Simulation - Parameter identifications with error bound
Pure adaptive search in global optimization

Mathematical Programming: Series A and B
Hesitant adaptive search for global optimisation

Mathematical Programming: Series A and B
New reflection generator for simulated annealing in mixed-integer/continuous global optimization

Journal of Optimization Theory and Applications

On success rates for controlled random search

Journal of Global Optimization
On the Investigation of Stochastic Global Optimization Algorithms

Journal of Global Optimization
Random search optimization approach for highly multi-modal nonlinear problems

Advances in Engineering Software
Two aspects of optimal diet determination for pig production: efficiency of solution and incorporation of cost variation

Journal of Global Optimization
Random search optimization approach for highly multi-modal nonlinear problems

Advances in Engineering Software
Accounting for structural error and uncertainty in a model: An approach based on model parameters as stochastic processes

Environmental Modelling & Software
A hybrid method for quantum global optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of generating a random sample over a level set, called Uniform Covering, is considered. A variant is discussed of an algorithm known as Pure Adaptive Search which is a global optimisation ideal with a desirable complexity. The algorithm of Uniform Covering by Probabilistic Rejection is discussed as an approach to the practical realisation of PAS. Consequences for the complexity and practical performance in comparison to other algorithms are illustrated.