Skip to main content
SpringerLink
Log in

Symbolic-Interval Heuristic for Bound-Constrained Minimization

  • Conference paper
Global Optimization and Constraint Satisfaction (COCOS 2002)

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

  • 643 Accesses

Abstract

Global optimization subject to bound constraints helps answer many practical questions in chemistry, molecular biology, economics. Most of algorithms for solution of global optimization problems are a combination of interval methods and exhuastive search. The efficiency of such algorithms is characterized by their ability to detect and eliminate sub-optimal feasible regions. This ability is increased by availability of a good upper bound on the global minimum. In this paper, we present a symbolic-interval algorithm for calculation of upper bounds in bound-constrained global minimization problems and report the results of some experiments.

Financially supported by Centre Franco-Russe Liapunov (Project 06-98), by European project COCONUT IST-2000-26063.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Armengol Llobet, J.: Application of modal interval analysis to the simulation of the behaviour of dynamicsy stems with uncertain parameters. Ph. D. thesis (1999)

    Google Scholar 

  2. Dixon, L.C.W., Szegö, G.P.: Towards Global Optimization. North-Holland, Amsterdam (1975–1978)

    Google Scholar 

  3. Fiacco, A.V., McCormick, G.P.: Nonlinear Programming. Sequential unconstrained minimization techniques. Wiley, Chichester (1990) (reprinted by SIAM publications)

    MATH  Google Scholar 

  4. Griewank, A.: On automaticd ifferentiation. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developments and Applications, pp. 83–108. Kluwer Academic Publishers, Dordrecht (1989)

    Google Scholar 

  5. Hansen, E.: Global optimization using interval analysis. Pure and applied mathematics, vol. 165. Marcel Dekker, New York (1992)

    MATH  Google Scholar 

  6. Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. Journal of Global Optimization 14, 331–355 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jansson, C., Knüppel, O.: A global minimization method: the multi-dimensional case. Technische Informatik-III, TU Hamburg-Harburg (1992)

    Google Scholar 

  8. Kaucher, E.: Interval analysis in the extended interval space IR. Computing, Suppl. 2, 33–49 (1980)

    MathSciNet  Google Scholar 

  9. Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIN — Université de Nantes, 2 rue de la Houssinière, BP 92208, 44322, Nantes Cedex 03, France

    Evgueni Petrov

Authors
  1. Evgueni Petrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ILOG, 1681-HB2 Route des Dolines, 06560, Valbonne, France

    Christian Bliek

  2. LINA, FRE CNRS 2729 – University of Nantes, 2, rue de la Houssinière – BP 92208, F-44322, Nantes cedex 3, France

    Christophe Jermann

  3. Institute for Mathematics, University Wien, Nordbergstr. 15, A-1090, Wien, Austria

    Arnold Neumaier

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petrov, E. (2003). Symbolic-Interval Heuristic for Bound-Constrained Minimization. In: Bliek, C., Jermann, C., Neumaier, A. (eds) Global Optimization and Constraint Satisfaction. COCOS 2002. Lecture Notes in Computer Science, vol 2861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39901-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39901-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20463-3

  • Online ISBN: 978-3-540-39901-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation