Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Eremin I. I., Teoriya lineinoi optimizatsii, UrO RAN, Ekaterinburg, 1998
[2] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983 | MR
[3] Razumikhin B. S., Fizicheskie modeli i metody teorii ravnovesiya v programmirovanii i ekonomike, Nauka, M., 1975 | MR
[4] Mangasarian O. L., “A finite Newton method for classification”, Optimizat. Meth. Software, 17 (2002), 913–930 | DOI | MR
[5] Mangasarian O. L., A Newton method for linear programming, Data Mining Inst. Techn. Rept. 02-02, March 2002
[6] Kanzow C., Qi H., Qi L., “On the minimum norm solution of linear program”, J. Optimizat. Theory and Appl., 116 (2003), 333–345 | DOI | MR | Zbl
[7] Polyak B. T., Tretyakov H. B., “Ob odnom iteratsionnom metode lineinogo programmirovaniya i ego ekonomicheskoi interpretatsii”, Ekonomika i matem. metody, 8:5 (1972), 740–751
[8] Antipin A. S., Metody nelineinogo programmirovaniya, osnovannye na pryamoi i dvoistvennoi modifikatsii funktsii Lagranzha, VNIISI, M., 1979
[9] Evtushenko Yu. G., Golikov A. I., “The augmented Lagrangian function for the linear programming problems”, Dynamic Non-homogeneous Systems, v. 2, Rus. Acad. Sci. Inst. System Analys., M., 1999, 63–67
[10] Golikov A. M., Evtushenko Yu. G., “Otyskanie normalnykh reshenii v zadachakh lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 40:12 (2000), 1766–1786 | MR | Zbl
[11] Eremin I. I., “O kvadratichnykh zadachakh i polnokvadratichnykh zadachakh vypuklogo programmirovaniya”, Izv. vuzov. Matematika, 1998, no. 12, 22–28 | MR | Zbl
[12] Golikov A. I., Evtushenko Yu. G., “Teoremy ob alternativakh i ikh primenenie v chislennykh metodakh”, Zh. vychisl. matem. i matem. fiz., 43:3 (2003), 354–375 | MR | Zbl
[13] Fiakko A., Mak-Kormik G., Nelineinoe programmirovanie. Metody posledovatelnoi bezuslovnoi minimizatsii, Mir, M., 1972 | MR | Zbl
[14] Tikhonov A. N., Izbrannye trudy, MAKS Press, M., 2001 | Zbl
[15] Vasilev F. P., Ivanitskii A. Yu., Lineinoe programmirovanie, Faktorial, M., 2003 | MR