Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Traub Dzh., Vozhnyakovskii Kh., Obschaya teoriya optimalnykh algoritmov, Mir, M., 1983 | MR | Zbl
[2] Sukharev A. G., Minimaksnye algoritmy v zadachakh chislennogo analiza, Nauka, M., 1989 | MR | Zbl
[3] Podobedov V. E., “Optimalnyi algoritm poiska ekstremuma lipshitsevykh funktsii pri proizvolnoi lineinoi informatsii”, Sistemnoe programmirovanie i vopr. optimizatsii, Izd-vo MGU, M., 1987, 180–187 | MR
[4] Traub Dzh., Vasilkovskii G., Vozhnyakovskii X., Informatsiya, neopredelennost, slozhnost, Mir, M., 1988 | MR | Zbl
[5] Ostapenko O. S., “Ob optimalnykh algoritmakh minimizatsii funktsii v klassakh $C^n_{1, L, N}$, $C^n_{1, L, N, \varepsilon}$, $\widetilde{C}^n_{1, L, N, \delta}$”, Kibernetika, 1983, no. 5, 88–95 | MR
[6] Podobedov V. E., “Nakhozhdenie maksimuma priblizhenno vychislyaemykh lipshitsevykh funktsii pri uslovii ogranichennosti resursov”, Vychisl. sistemy i vopr. prinyatiya reshenii, Izd-vo MGU, M., 1991, 169–180 | MR | Zbl