Approximately optimal algorithms for determining extrema in a certain class of functions
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 3, pp. 355-365
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of designing approximately optimal algorithms to find the extrema of functions in a certain class, which is closed under various natural operations and contains concave, convex and Lipschitz functions, is considered.
[1] Sukharev A. G., Optimalnyi poisk ekstremuma, Izd-vo MGU, M., 1975
[2] Chernousko F. L., Melikyan A. A., Igrovye zadachi upravleniya i poiska, Nauka, M., 1978 | MR
[3] Korotchenko A. G., “Ob odnom algoritme poiska naibolshego znacheniya odnomernykh funktsii”, Zh. vychisl. matem. i matem. fiz., 18:3 (1978), 563–573 | MR | Zbl