Skip to main content
SpringerLink
Log in

Parallelization of the Continuous Global Optimization Problem with Inequality Constraints by Using Interval Arithmetic⋆

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2110))

Included in the following conference series:

Abstract

In this work, we study on distributed memory architecture, the parallelization of the continuous global optimization problem, based on interval arithmetic, with inequality constraints. Since this algorithm is dynamic and irregular, we propose, in particular, some techniques taking into account the load balancing problem.

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

Access this chapter

Log in via an institution
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. Benyoub A., Daoudi E.M.: An Algorithm for Finding an Approximate Feasible Point by Using Interval Arithmetic, LaRI Laboratory, Dept. Maths&CS. Faculty for Science, Univ. Mohammed First, Oujda, Morocco, 2000.

    Google Scholar 

  2. Berner S.: A Parallel Method for Verified Global Optimization, Scientific Computing and Validated Numerics: Proc. Int. Sym. on Sc. Computing; G. Alefeld, A. Frommer, B. Lang editors, Akademie Verlag GmbH, Berlin, Germany, 1996.

    Google Scholar 

  3. Casado L.G., Garcia I.: Work Load Balance approaches for Branch-and-Bound Algorithms on Distributed Systems, Department of Computer Architecture and Electronics, Almeria University, Almeria, Spain.

    Google Scholar 

  4. Denneulin Y., Mehaut J.F., Planquelle B., Revol N.: Parallelization of Continuous Verified Global Optimization, Presented at the 19th Conference TC7 on System Modeling and Optimization, Cambridge, United Kingdom, July 1999.

    Google Scholar 

  5. Eriksson J., Lindstöm P.: A Parallel Interval Method Implementation for Global Optimization using Dynamic Load Balancing, Reliable Computing, 1, 1995, 77–91.

    Article  MATH  Google Scholar 

  6. Hansen E.: Global Optimization Using Interval Analysis, Marcel Decker, NewYork, USA, 1992.

    MATH  Google Scholar 

  7. Leclerc A.P.: Efficient and Reliable Global Optimization, PhD Thesis, The Ohio State University, USA, 1992.

    Google Scholar 

  8. Leclerc A.P.: Parallel Interval Global Optimization and its Implementation in C++, Interval Computations, 3, 1993, 148–163.

    MathSciNet  Google Scholar 

  9. Messine F.: Méthodes d’Optimisation Globale basées sur l’Analyse d’Intervalle pour la Résolution de Problèmes avec Contraintes, Thèse, Université Paul Sabatier, IRIT-Toulouse, France, Septembre, 1997.

    Google Scholar 

  10. Ratschek H., Rokne J.:New Computer Methods for Global Optimization, Ellis Horwood Limited, Market Cooper Street, Chichester, West Sussex, PO19 1EB, England, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science Faculty of Sciences, University of Mohammed First, Oujda, Morocco

    El Mostafa Daoudi

Authors
  1. Abdeljalil Benyoub
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. El Mostafa Daoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics, Computer Science, Physics,and Astronomy, University of Amsterdam, Kruislaan 403, 1098, SJ, Amsterdam, The Netherlands

    Bob Hertzberger  & Alfons Hoekstra  & 

  2. California Institute of Technology, Caltech 158-79, Pasadena, CA, 91125, USA

    Roy Williams

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benyoub, A., Daoudi, E.M. (2001). Parallelization of the Continuous Global Optimization Problem with Inequality Constraints by Using Interval Arithmetic⋆. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-48228-8_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42293-8

  • Online ISBN: 978-3-540-48228-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation