Hybrid Methods

Kurt Marti
Additional contact information
Kurt Marti: University of Bundeswehr Munich

Chapter Chapter 17 in Optimization Under Stochastic Uncertainty, 2020, pp 327-337 from Springer

Abstract: Abstract Depending on the type of the random search method, it may happen that the procedure finds rather fast a local extremum x l o c ∗ $$x_{loc}^{\ast }$$ of the objective function f under consideration, but get then stuck in this point. On the other hand, there are procedures having features to omit this behavior. For example, a special property of simulated annealing methods is that also non-improving steps are possible with decreasing probability (cooling). Thus, steps out of the neighborhood of a local extremum are possible with a certain probability.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-55662-4_17

Ordering information: This item can be ordered from
http://www.springer.com/9783030556624

DOI: 10.1007/978-3-030-55662-4_17

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().