Skip to main content
Log in

Parallel Characteristical Algorithms for Solving Problems of Global Optimization

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

Abstract

A class of parallel characteristical algorithms for global optimization ofone-dimensional multiextremal functions is introduced. General convergence andefficiency conditions for the algorithms of the class introduced areestablished. A generalization for the multidimensional case is considered.Examples of parallel characteristical algorithms and numerical experiments arepresented.

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

  1. Alliant. Product Summary (1989), Alliant Computer Systems Corporation, Littletown.

  2. Archetti, F., and Betrò, B. (1979), A Probabilistic Algorithm for Global Optimization, Calcolo {vn16(3)}, 335–343.

    Google Scholar 

  3. Avriel, M., and Wilde, D.J. (1966), Optimal Search for a Maximum with Sequences of Simultaneous Function Evaluations, Management Science 12, 722–731.

    Google Scholar 

  4. Bertocchi, M. (1990), A Parallel Algorithm for Global Optimization, Optimization 62(3), 379–386.

    Google Scholar 

  5. Butz, A.R. (1968), Space Filling Curves andMathematical Programming, Inform. Control 12(4), 314–330.

    Google Scholar 

  6. Chazan, D., and Miranker, W.L. (1970), A Non-gradient and Parallel Algorithm for Unconstrained Minimization, SIAM Journal on Control and Optimization 70, 207–217.

    Google Scholar 

  7. Eriksen, O., and Staunstrup, J. (1983), Concurrent Algorithms for Root Searching, Acta Informatica 18, 361–376, 501–511.

    Google Scholar 

  8. Evtushenko, Yu.G. (1971), Numerical Method of Global Extremum Search. Journal of Computational Math. and Math. Physics 11(6), 1390–1403 (in Russian).

    Google Scholar 

  9. Gergel, V.P., Sergeyev, Ya.D., and Strongin, R.G. (1992), A Parallel Global Optimization Method and Its Implementation on a Transputer System, Optimization 26, 261–275.

    Google Scholar 

  10. Grishagin, V.A. (1979), On Convergence Conditions for a Class of Global Search Algorithms. Theses of report to 3rd All-Union Seminar Numerical Methods of Nonlinear Programming, Kharkov, 82–84 (in Russian).

  11. Grishagin, V.A. (1983), On Properties of One Class of Optimization Algorithms. Transactions of 3rd conference of young scientists of Applied Mathematics and Cybernetics Research Institute of Gorky University, Gorky, Nov. 24–26, 1982. Part 2, Gorky University, Gorky, 50–58. Deposited with VINITI, Aug. 14, 1984. No.5836-84 Dep.

  12. Hansen, P., Jaumard, B., and Lu, S.-H. (1989), Global Optimization of Univeriate Lipschitz Functions: 2. New Algorithms and Computational Comparison, Math. Programming 55, 273–293.

    Google Scholar 

  13. Horst, R., Pardalos, P.M. (Eds.) (1995), Handbook on Global Optimization, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  14. Kushner, H. (1964), A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise, Transactions ASME, Ser. D, J. Basic Eng. 86(1), 97–106.

    Google Scholar 

  15. Lucidi S. and Piccioni M. (1989) Random tunneling by means of acceptance-rejection sampling for global optimization, JOTA 62(2), 255–277.

    Google Scholar 

  16. Pardalos, P.M., Phillips, A.T., and Rosen, J.B. (1992), Topics in Parallel Computing in Mathematical Programming, Science Press.

  17. Pintér, J. (1983), A Unified Approach to Globally Convergent One-dimensional Optimization Algorithms, Technical report I AMI-83.5, Istituto per le Applicazioni della Matematica e dell’Informatica CNR, Milan.

    Google Scholar 

  18. Pintér, J. (1992), Convergence Qualification of Adaptive Partition Algorithms in Global Optimization, Math. Programming 56, 343–360.

    Google Scholar 

  19. Piyavskii, S.A. (1972), An Algorithm of Function Absolute Extremum Search, Journal of Computational Math. and Math. Physics 12(4), 888–896 (in Russian).

    Google Scholar 

  20. Schendel, U. (1984), Introduction to Numerical Methods for Parallel Computers, Ellis Horwood, Chichester, England.

    Google Scholar 

  21. Sergeyev, Ya.D. (1995), An information global optimization algorithm with local tuning, SIAM Journal on Optimization 5(4), 615–631.

    Google Scholar 

  22. Sergeyev, Ya.D., and Grishagin, V.A. (1994), A Parallel Method for Finding the Global Minimum of Univariate Functions, JOTA 80(3), 513–536.

    Google Scholar 

  23. Sergeyev, Ya.D., and Grishagin, V.A. (1994), Sequential and Parallel Algorithms for Global Optimization, Optimization Methods and Software 3, 111–124.

    Google Scholar 

  24. Sergeyev, Ya.D., and Strongin, R.G. (1989), An Algorithm of Global Minimization with Parallel Iterations, Journal of Computational Math. and Math. Physics 29(2), 7–15.

    Google Scholar 

  25. Sergeyev, Ya.D., and Strongin, R.G. (1992), Global Multidimensional Optimization on Parallel Computer, Parallel Computing 18, 1259–1273.

    Google Scholar 

  26. Strongin, R.G. (1978), Numerical Methods in Multiextremal Problems (Information-Statistic Algorithms), Nauka, Moskow (in Russian).

    Google Scholar 

  27. Strongin, R.G., and Sergeyev, Ya.D. (1988), Effective Algorithm for Global Optimization with Parallel Computations, in Lecture Notes in Economics and Mathematical Systems, vol. 304, Springer, Berlin, 158–162.

    Google Scholar 

  28. Sutti, C. (1984), Local and Global Optimization by Parallel Algorithms for MIMD Systems, Annals of Operations Research 1, 151–164.

    Google Scholar 

  29. Van Laarhoven, P.J.M. (1985), Parallel Variable Metric Algorithm for Unconstrained Optimization, Mathematical Programming 33, 68–87.

    Google Scholar 

  30. Zhiglyavsky, A.A. (1991), Theory of Global Random Search, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  31. Zilinskas, A.G. (1975), One-Step Bayesian Method for Finding the Extremum of One-dimensional Functions, Cybernetics 1, 139–144 (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grishagin, V.A., Sergeyev, Y.D. & Strongin, R.G. Parallel Characteristical Algorithms for Solving Problems of Global Optimization. Journal of Global Optimization 10, 185–206 (1997). https://doi.org/10.1023/A:1008242328176

Download citation

  • Issue Date:

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

Navigation