Skip to main content
Log in

Multistart method with estimation scheme for global satisfycing problems

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

Abstract

We present a multistart method for solving global satisfycing problems. The method uses data generated by linearly converging local algorithms to estimate the cost value at the local minimum to which the local search is converging. When the estimate indicates that the local search is converging to a value higher than the satisfycing value, the local search is interrupted and a new local search is initiated from a randomly generated point. When the satisfycing problem is difficult and the estimation scheme is fairly accurate, the new method is superior over a straightforward adaptation of classical multistart methods.

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.

Similar content being viewed by others

References

  1. F. Archetti and F. Schoen (1984), A Survey on the Global Optimization Problem: General Theory and Computational Approaches,Annals of Operations Research 1, 87–110.

    Google Scholar 

  2. B. Betro and F. Schoen (1987), Sequential Stopping Rules for the Multistart Algorithm in Global Optimization,Math. Prog. 38, 271–286.

    Google Scholar 

  3. C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer, and L. Stougie (1982), A Stochastic Method for Global Optimization,Math. Prog. 22, 125–140.

    Google Scholar 

  4. C. G. E. Boender and A. G. H. Rinnooy Kan (1982), Bayesian Stopping Rules for Multistart Global Optimization Methods,Math. Prog. 37, 59–80.

    Google Scholar 

  5. R. H. Byrd, C. L. Dert, A. H. G. Rinnooy Kan, and R. B. Schnabel (1990), Concurrent Stochastic Methods for Global Optimization,Math. Prog. 46, 1–30.

    Google Scholar 

  6. L. C. Dixon and G. P. Szego, eds. (1978),Towards Global Optimization II, North-Holland, Amsterdam.

    Google Scholar 

  7. W. Feller (1961),Introduction to Probability Theory and Its Applications, Wiley, NY.

    Google Scholar 

  8. L. He and E. Polak (1990), Effective Diagonalization Strategies for the Solution of a Class of Optimal Design Problems,IEEE Trans. Auto. Control 35, 258–267.

    Google Scholar 

  9. A. V. Levy, A. Montalvo, S. Gomez, and A. Calderon (1981), Topics in Global Optimization,Numerical Analysis, Lecture notes in Math. 909, pp. 18–33.

  10. J. G. March and H. A. Simon (1958),Organizations, Wiley, New York.

    Google Scholar 

  11. A. C. Matos (1990), Acceleration Methods Based on Convergence Tests,Num. Math. 58, 329–340.

    Google Scholar 

  12. O. Pironneau and E. Polak (1972), On the Rate of Convergence of Certain Methods of Centers,Mathematical Programming 2(2), 230–258.

    Google Scholar 

  13. E. Polak (1971),Computational Methods in Optimization: A Unified Approach, Academic Press, New York.

    Google Scholar 

  14. E. Polak (1987), On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design,SIAM Review 29(1), 21–91.

    Google Scholar 

  15. E. Polak (1989), Basics of Minimax Algorithms, in F. H. Clarke, V. F. Dem'yanov, and F. Giannessi eds.,Nonsmooth Optimization and Related Topics, pp. 343–367, Plenum Press, New York.

    Google Scholar 

  16. E. Polak and L. He (1992), Rate Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control,SIAM J. Control & Optimization 30(3), 548–572.

    Google Scholar 

  17. E. Polak and L. He (1991), Finite-Termination Schemes for Solving Semi-Infinite Satisfycing Problems,J. Optimization Theory and Applications 70(3), 429–466.

    Google Scholar 

  18. B. N. Pshenichnyi and Yu. M. Danilin (1975),Numerical Methods in External Problems (Chislennye melody v ekstremal'nykh zadachakh), Nauka, Moscow.

    Google Scholar 

  19. A. H. G. Rinnooy Kan and G. T. Timmer (1987), Stochastic Global Optimization Methods Part I: Clustering MethodsMath. Prog. 39, 27–56.

    Google Scholar 

  20. A. H. G. Rinnooy Kan and G. T. Timmer (1987), Stochastic Global Optimization Methods Part II: Multi Level Methods,Math. Prog. 39, 57–78.

    Google Scholar 

  21. A. Torn (1977), Cluster Analysis Using Seed Points and Density-Determined Hyperspheres with an Application to Global Optimization,IEEE Trans, on Systems, Man and Cybernetics 7(8), 610–615.

    Google Scholar 

  22. A. P. Wierzbicki (1982), A Mathematical Basis for Satisfycing Decision-Making,Mathematical Modeling 3(5), 391–405.

    Google Scholar 

  23. R. Zielinski (1981), A Statistical Estimate of the Structure of Multi-Extremal Problems,Math. Prog. 21, 348–356.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, L., Polak, E. Multistart method with estimation scheme for global satisfycing problems. J Glob Optim 3, 139–156 (1993). https://doi.org/10.1007/BF01096735

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01096735

Key words

Navigation