Advertisement
Published in:
2020 | OriginalPaper | Chapter
17. Hybrid Methods
Author : Kurt Marti
Published in: Optimization Under Stochastic Uncertainty
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Depending on the type of the random search method, it may happen that the procedure finds rather fast a local extremum \(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.