IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-04331-8_36.html
   My bibliography  Save this book chapter

Basic Principles of Annealing for Large Scale Non-Linear Optimization

In: Online Optimization of Large Scale Systems

Author

Listed:
  • Joachim M. Buhmann

    (Rheinische Friedrich-Wilhelm Universität Bonn, Institut für Informatik)

  • Jan Puzicha

    (University of California, Department of Computer Science)

Abstract

Computational Annealing, a class of optimization heuristics that are inspired by statistical physics of phase transitions has been demonstrated to be highly effective for large, non-linear combinatorial optimization problems. In many applications in computer vision and pattern recognition one encounters non-linear objective functions with a very large number of discrete and possibly additional continuous variables. Typical cases of such problems are clustering, grouping and image segmentation or assignment problems in motion or stereo analysis or in object recognition. For this type of problems, standard integer programming techniques are not applicable and one has to resort to optimization heuristics that are fast, yet avoid a possibly exponential number of unfavorable local minima. A particularly powerful, generic class of algorithms is provided by simulated or deterministic annealing techniques. Simulated annealing and the Gibbs sampler are discussed first to present the basic concepts; then, the theory of deterministic annealing is presented in great detail and the relation to continuation methods are discussed.

Suggested Citation

  • Joachim M. Buhmann & Jan Puzicha, 2001. "Basic Principles of Annealing for Large Scale Non-Linear Optimization," Springer Books, in: Martin Grötschel & Sven O. Krumke & Jörg Rambau (ed.), Online Optimization of Large Scale Systems, pages 749-777, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-04331-8_36
    DOI: 10.1007/978-3-662-04331-8_36
    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-662-04331-8_36. 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.