Skip to main content

A Novel Parallel Interval Exclusion Algorithm

  • Conference paper
High Performance Computing and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5938))

  • 2310 Accesses

Abstract

The optimization algorithm based on interval analysis is a deterministic global optimization algorithm. However, Solving high-dimensional problems, traditional interval algorithm exposed lots of problems such as consumption of time and memory. In this paper, we give a parallel interval global optimization algorithm based on evolutionary computation. It combines the reliability of interval algorithm with the intelligence and nature scalability of mind evolution computation algorithm, effectively overcomes the shortcomings of Time-Consuming and Memory-Consuming of the traditional interval algorithm. Numerical experiments show that the algorithm has much high efficiency than the traditional interval algorithm.

This work is supported by Shanghai Leading Academic Discipline Project J50103.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Casado, L.G., Martinez, J.A., Garcia, I.: Experiment with a new selection criterion in a fast interval optimization algorithm. Journal of Global Optimization 19, 247–264 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Csendes, T., Laszlopal, J.O., Sendin, H.: The Global optimization method revisited. Optim. Lett. 2, 445–454 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Flouds, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Opim. (2008), doi:10.1007/s

    Google Scholar 

  4. Hsirch, M.J., Meneses, C.N., Pardalos: Global Optimization by continuous GRASP. Optim. Lett. 1, 201–212 (2007)

    Article  MathSciNet  Google Scholar 

  5. Casado, L.G., Garcia, I., Csendes, T.: A new Multi-section technique in interval methods for global optimization. Computing 65, 263–269 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Sotiropoulos, D.G., Stavropoulos, E.C.: A new hybrid genetic algorithm for global optimization. Nonlinear Analysis, Theory, Methods and Applications 30, 4529–4538 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chengyi, S., Yan, S.: Mind-Evolution-Based Machine Learning: Framework and the Implementation of Optimization. In: Kopacek, P. (ed.) Proc of IEEE Int. Conf on intelligent Engineering systems, September 17-19. IEEE Inc., Vienna (1998)

    Google Scholar 

  8. Chengyi, S., Jianqing, Z., Junli, W.: The analysis of efficiency of similartaxis searching. In: Joint 9th IFAS World Congress and 20th NAFIPS International Conference, pp. 35–48 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lei, Y., Chen, S., Yan, Y. (2010). A Novel Parallel Interval Exclusion Algorithm. In: Zhang, W., Chen, Z., Douglas, C.C., Tong, W. (eds) High Performance Computing and Applications. Lecture Notes in Computer Science, vol 5938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11842-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11842-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11841-8

  • Online ISBN: 978-3-642-11842-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics