Jp. Aubin et L. Najman, THE MONTAGNES-RUSSES ALGORITHM FOR GLOBAL OPTIMIZATION, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 319(6), 1994, pp. 631-636
The ''Montagnes Russes'' algorithm for finding a global minimum of a l
ower semi-continuous function (thus involving state constraints) is a
descent algorithm applied to an auxiliary function whose minima are th
e global minima of the original function. This auxiliary function is o
btained as a supremum of an increasing sequence of functions.