Skip to main content
Log in

On Uniform Covering, Adaptive Random Search and Raspberries

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baritompa, W.P. and Steel, M.A. (1996), Bounds on absorption times of directionally biased random sequences, Random Structures and Algorithms 9: 279-293.

    Google Scholar 

  • Baritompa, W.P., Mladineo, R.H., Wood, G.R., Zabinsky, Z.B. and Zhang Baoping (1995), Towards pure adaptive search, Journal of Global Optimization 7: 73-110.

    Google Scholar 

  • Bates, D.M. and Watts, D.G. (1988), Nonlinear regression analysis and its applications, Wiley, New York.

    Google Scholar 

  • Bulger, D.W. and Wood, G.R. (1998), Hesitant adaptive search for global optimisation, Mathematical Programming 81: 89-102.

    Google Scholar 

  • Cliff, A.D. and Ord, J.K. (1981), Spatial processes, models and applications, Pion Ltd., London.

    Google Scholar 

  • Donaldson, J.R. and Schnabel, R.B. (1987), Computational experience with confidence regions and confidence intervals for nonlinear least squares, Technometrics 29: 67-82.

    Google Scholar 

  • Garcia, I., Ortigosa, P.M., Casado, L.G., Herman, G.T. and Matej, S. (1997), Multidimensional Optimization in Image Reconstruction from Projections, in I.M. Bomze, T. Csendes, R. Horst and P.M. Pardalos (eds.), Developments in Global Optimization, Kluwer, pp. 289-300.

  • Hendrix, E.M.T. (1998), Global Optimization at Work, Ph.D. dissertation,Wageningen Agricultural University.

  • Klepper, O. and Rouse, D.I. (1991), A procedure to reduce parameter uncertainty for complex models by comparison with real system output illustrated on a potato growth model, Agricultural Systems 36: 375-395.

    Google Scholar 

  • Klepper, O. and Hendrix, E.M.T. (1994), A method for robust calibration of ecological models under different types of uncertainty, Ecological Modelling 74: 161-182.

    Google Scholar 

  • Klepper, O. and Bedaux, J.M. (1997), Nonlinear parameter estimation for toxicological threshold models, Ecological Modelling 102: 315-324.

    Google Scholar 

  • Patel, N.R., Smith, R. and Zabinsky, Z.B. (1988), Pure adaptive search in Monte Carlo optimization, Mathematical Programming 43: 317-328.

    Google Scholar 

  • Price, W.L. (1979), A controlled random search procedure for global optimization, The Computer Journal 20: 367-370.

    Google Scholar 

  • Ripley, B.D. (1981), Spatial Statistics, Wiley, New York.

    Google Scholar 

  • Romeijn, H.E. (1992), Global Optimization by Random Walk Sampling Methods, Ph.D. dissertation, Erasmus University, Rotterdam.

    Google Scholar 

  • Romeijn, H.E. and Smith, R.L. (1994), Simulated annealing for constrained global optimization, Journal of Global Optimization 5: 101-126.

    Google Scholar 

  • Romeijn, H.E., Zabinsky, Z.B., Graesser, D.L. and Neogi, S. (1999), A new reflexion generator for simulated annealing for mixed-interger / continuous global optimization, Journal of Optimization: Theory and Applications 101: 403-427.

    Google Scholar 

  • Ross, G.J.S. (1990), Nonlinear Estimation, Springer, New York.

    Google Scholar 

  • Smith, R.L. (1984), Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Operations Research 32: 1296-1308.

    Google Scholar 

  • Torn, A. and Zilinskas, A. (1989), Global Optimization, Springer, Berlin.

    Google Scholar 

  • Walter, E. and Piet-Lahanier, H. (1990), Estimation of parameter bounds from bounded-error data: a survey, Mathematics and Computers in Simulation 32: 449-468.

    Google Scholar 

  • Zabinsky, Z.B. and Smith, R.L. (1992), Pure adaptive search in global optimization, Mathematical Programming 53: 323-338.

    Google Scholar 

  • Zabinsky, Z.B., Smith, R.L., McDonald, J.F., Romeijn, H.E. and Kaufman, D.E. (1993), Improving Hit-and-Run for global optimization, Journal of Global Optimization 3: 171-192.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hendrix, E.M., Klepper, O. On Uniform Covering, Adaptive Random Search and Raspberries. Journal of Global Optimization 18, 143–163 (2000). https://doi.org/10.1023/A:1008394806170

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008394806170

Navigation