Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Probl. kibernetiki, 33 (1978), 6–58
[2] Zhuravlev Yu. I., Miroshnik C. H., Shvartin S. M., “Ob odnom podkhode k optimizatsii v klasse parametricheskikh algoritmov raspoznavaniya”, Zh. vychisl. matem. i matem. fiz., 16:1 (1976), 209–218 | MR | Zbl
[3] Yu. I. Zhuravlev (red.), Raspoznavanie. Klassifikatsiya. Prognoz, Nauka, M., 1988
[4] Ryazanov V. V., “Optimizatsiya algoritmov vychisleniya otsenok po parametram, kharakterizuyuschim predstavitelnost etalonnykh strok”, Zh. vychisl. matem. i matem. fiz., 16:6 (1976), 1559–1570 | MR | Zbl
[5] Eremin I. I., Mazurov V. D., Astafev H. H., Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya, Nauka, M., 1983 | MR
[6] Ashmanov S. A., Lineinoe programmirovanie, Nauka, M., 1981 | Zbl
[7] Arutyunov A. B., Usloviya ekstremuma. Anormalnye i vyrozhdennye zadachi, Faktorial, M., 1997 | MR | Zbl
[8] Arutyunov A. B., Yachimovich V., “K teorii anormalnykh ekstremalnykh zadach”, Vestn. MGU. Ser. Vychisl. matem. i kibernetika, 2000, no. 1, 34–40 | MR | Zbl