Skip to main content
Springer Nature Link
Log in

On Efficiency of Tightening Bounds in Interval Global Optimization

  • Conference paper
Applied Parallel Computing. State of the Art in Scientific Computing (PARA 2004)

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

Included in the following conference series:

  • 1508 Accesses

Abstract

The tightness of bounds is very important factor of efficiency of branch and bound based global optimization algorithms. An experimental model of interval arithmetic with controllable tightness of bounds is proposed to investigate the impact of bounds tightening in interval global optimization. A parallel version of the algorithm is implemented to cope with the computational intensity of the experiment. The experimental results on efficiency of tightening bounds are presented for several test and practical problems. The suitability of mater-slave type parallelization to speed up the experiments is justified.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 2nd edn. Springer, Heidelberg (1993)

    Google Scholar 

  2. Horst, R., Pardalos, P.: Handbook of Global Optimization. Kluwer Academic Publishers, Dodrecht (1995)

    MATH  Google Scholar 

  3. Törn, A., Žilinskas, A.: Global Optimization. LNCS, vol. 350, pp. 1–255. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  4. Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker, New York (2003)

    Google Scholar 

  5. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dodrecht (1996)

    MATH  Google Scholar 

  6. Ratschek, H., Rokne, J.: New Computer Methods for Global Optimization. Ellis Horwood, Chichester (1995)

    Google Scholar 

  7. Žilinskas, J., Bogle, I.D.L.: Balanced random interval arithmetic. Computers and Chemical Engineering 28(5), 839–851 (2004)

    Article  Google Scholar 

  8. Žilinskas, J., Bogle, I.D.L.: Evaluation ranges of functions using balanced random interval arithmetic. Informatica 14(3), 403–416 (2003)

    MATH  MathSciNet  Google Scholar 

  9. Clausen, J.: Parallel branch and bound – principles and personal experiences. In: Migdalas, A., Pardalos, P.M., Storøy, S. (eds.) Parallel Computing in Optimization, pp. 239–267. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  10. Gau, C.Y., Stadtherr, M.A.: Parallel branch-and-bound for chemical engineering applications: Load balancing and scheduling issues. In: Palma, J.M.L.M., Dongarra, J., Hernández, V. (eds.) VECPAR 2000. LNCS, vol. 1981, pp. 273–300. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Gendron, B., Crainic, T.G.: Parallel branch-and-bound algorithms – survey and synthesis. Operations Research 42(6), 1042–1066 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. SUN Microsystems. C++ Interval Arithmetic Programming Reference. Forte Developer 6 update 2 (Sun WorkShop 6 update 2) (2001)

    Google Scholar 

  13. Lerch, M., Tischler, G., von Gudenberg, J.W., Hofschuster, W., Krämer, W.: The interval library filib++ 2.0 - design, features and sample programs. Preprint 2001/4, UniversitätWuppertal (2001)

    Google Scholar 

  14. Žilinskas, J.: Comparison of packages for interval arithmetic. Informatica 16(1), 145–154 (2005)

    MATH  MathSciNet  Google Scholar 

  15. Message Passing Interface Forum. MPI: A message-passing interface standard (version 1.1). Technical report (1995)

    Google Scholar 

  16. Madsen, K., Žilinskas, J.: Testing branch-and-bound methods for global optimization. Technical report 05/2000, Technical University of Denmark (2000)

    Google Scholar 

  17. Csendes, T.: Optimization methods for process network synthesis – a case study. In: Carlsson, C., Eriksson, I. (eds.) Global & multiple criteria optimization and information systems quality, pp. 113–132. Abo Academy, Turku (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, MII, Akademijos g. 4, 08663, Vilnius, Lithuania

    Antanas Žilinskas & Julius Žilinskas

  2. Vytautas Magnus University,  

    Antanas Žilinskas

Authors
  1. Antanas Žilinskas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julius Žilinskas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  2. Department of Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Kaj Madsen

  3. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Žilinskas, A., Žilinskas, J. (2006). On Efficiency of Tightening Bounds in Interval Global Optimization. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_22

Download citation

  • DOI: https://doi.org/10.1007/11558958_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29067-4

  • Online ISBN: 978-3-540-33498-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics