IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-79651-7_7.html
   My bibliography  Save this book chapter

Global Optimization

In: C++ Toolbox for Verified Computing I

Author

Listed:
  • Ulrich Kulisch

    (Universität Karlsruhe, Institut für Angewandte Mathematik)

  • Rolf Hammer

    (Universität Karlsruhe, Institut für Angewandte Mathematik)

  • Matthias Hocks

    (Universität Karlsruhe, Institut für Angewandte Mathematik)

  • Dietmar Ratz

    (Universität Karlsruhe, Institut für Angewandte Mathematik)

Abstract

We want to find the global minimum in an interval [x] of a function f that may have many local minima. We want to compute the minimum value of f and the point(s) at which the minimum value is attained. This is a very difficult problem for classical methods because narrow, deep valleys may escape detection. In contrast, the interval method presented here evaluates f on a continuum of points, including those points that are not finitely represent able, so valleys, no matter how narrow, are recognized with certainty. Further, interval techniques often can reject large regions in which the optimum can be guaranteed not to lie, so they can be faster overall than classical methods for many problems.

Suggested Citation

  • Ulrich Kulisch & Rolf Hammer & Matthias Hocks & Dietmar Ratz, 1995. "Global Optimization," Springer Books, in: C++ Toolbox for Verified Computing I, chapter 0, pages 113-139, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-79651-7_7
    DOI: 10.1007/978-3-642-79651-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-79651-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.