The Montagne Russe algorithm for global optimization
Jean-Pierre Aubin and
Laurent Najman
Mathematical Methods of Operations Research, 1998, vol. 48, issue 2, 153-168
Abstract:
The “Montagnes Russes” algorithm for finding the global minima of a lower semi-continuous function (thus involving state constraints) is a descent algorithm applied to an auxiliary function whose local and global minima are the global minima of the original function. Although this auxiliary function decreases along the trajectory of any of its minimizing sequences, the original function jumps above local maxima, leaves local minima, play “Montagnes Russes” (called “American Mountains” in Russian and “Big Dipper” in American!), but, ultimately, converges to its infimum. This auxiliary function is approximated by an increasing sequence of functions defined recursively at each point of the minimizing sequence. Copyright Springer-Verlag Berlin Heidelberg 1998
Keywords: Key words: Global optimization; viability theory; viability kernel; Lyapunov function (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1007/s001860050018 (text/html)
Access to full text is restricted to subscribers.
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:mathme:v:48:y:1998:i:2:p:153-168
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/s001860050018
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().