| References |
I. I. Eremin, “Some iterative methods in convex programming,” Ekon. Mat. Metody, 15, No. 6 (1966); M. S. Khripun, “Some modifications of Feuer methods of solving systems of linear inequalities: Applications of convex-programming methods,” Tr. Inst. Mat. Mekh. Ural. Nauchn. Tsentr. Akad. Nauk SSSR, No. 4 (1973); Vl. D. Mazurov, “Pattern recognition as a means of automatic procedure choice in computational methods,” Zh. Vychisl. Mat. Mat. Fiz., 10, No. 6 (1970); I. I. Eremin, “Discrete processes of Feuer type for unsmooth problems in convex programming,” Algebra Logika, 15, No. 6 (1977); M. A. Kostina and M. S. Khripun, “Ways of accelerating the convergence of Feuer processes: Mathematical methods in optimal planning,” Tr. Inst. Mat. Mekh. Ural. Nauchn. Tsentr. Akad. Nauk SSSR, No. 3 (1971); Vl. D. Mazurov, “Sets of inequality systems and recognition problems,” Kibernetika, No. 3 (1971) |