Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Baiokki K., Kapelo A., Variatsionnye i kvazivariatsionnye neravenstva. Prilozheniya k zadacham so svobodnoi granitsei, Nauka, M., 1988 | MR
[2] Nagurney A., Network economics: A variational inequality approach, Kluwer Academic Publs., Dordrecht, 1999 | MR
[3] Konnov I. V., Combined relaxation methods for variational inequalities, Springer, Berlin etc., 2001 | MR
[4] Patriksson M., Nonlinear programming and variational inequality problems: A unified approach, Kluwer Acad. Publs., Dordrecht, 1999 | MR | Zbl
[5] Golshtein E. G., Tretyakov N. V., Modifitsirovannye funktsii Lagranzha, Nauka, M., 1989 | MR
[6] Lions P. L., Mercier B., “Splitting algorithm for the sum of two nonlinear operators”, SIAM J. Numer. Analys., 16:6 (1979), 964–979 | DOI | MR | Zbl
[7] Gabay D., “Application of the method of multipliers to variational inequalities”, Augmented Lagrangian Methods: Appl. Numer. Solution of Boundary-Value Problems, North-Holland, Amsterdam, 1983, 299–331
[8] Tseng P., “Applications of a splitting algorithm to decomposition in convex programming and variational inequalities”, Math. Program., 29:1 (1991), 119–138 | MR | Zbl
[9] Antipin A. S., “Metody resheniya sistem zadach vypuklogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 27:3 (1987), 368–376 | MR
[10] Konnov I. V., “Priblizhennye metody dlya pryamo-dvoistvennykh variatsionnykh neravenstv smeshannogo tipa”, Izv. vuzov. Matematika, 2000, no. 12, 55–66 | MR | Zbl
[11] Zhu D. L., Marcotte P., “Coupling the auxiliary problem principle with descent methods of pseudoconvex programming”, Europ. J. Operat. Res., 83 (1995), 670–685 | DOI | Zbl