论文信息 - A Combined Relaxation Method for a Class of Nonlinear Variational Inequalities

A Combined Relaxation Method for a Class of Nonlinear Variational Inequalities

In this paper, we describe a class of combined relaxation methods for the non strictly monotone nonlinear variational inequality problem, which involves a max-type convex function. This method is readily implementable and attains a linear rate of convergence under certain additional assumptions.

Igor V. Konnov | I. Konnov

[1] I. Konnov. A Class of Combined Iterative Methods for Solving Variational Inequalities , 1997 .

[2] Michael Patriksson,et al. Merit functions and descent algorithms for a class of variational inequality problems , 1997 .

[3] Andrew R. Conn,et al. A Structure-Exploiting Algorithm for Nonlinear Minimax Problems , 1992, SIAM J. Optim..

[4] I. Konnov. On the convergence of combined relaxation methods for variational inequalties , 1998 .

[5] J. J. Moré,et al. Algorithms for bound constrained quadratic programming problems , 1989 .

[6] C. Baiocchi,et al. Variational and quasivariational inequalities: Applications to free boundary problems , 1983 .

[7] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .

[8] S. P. Han,et al. Variable metric methods for minimizing a class of nondifferentiable functions , 1977, Math. Program..

[9] R. Bellman,et al. An Introduction to Minimax , 1976 .

[10] Lothar Reichel,et al. Iterative solution methods for ill-posed problems , 1995, Optics & Photonics.

[11] Gregory B. Passty. Ergodic convergence to a zero of the sum of monotone operators in Hilbert space , 1979 .

[12] A. Kaplan,et al. Stable Solution of Variational Inequalities with Composed Monotone Operators , 1999 .

[13] Mustafa Ç. Pinar,et al. Bound constrained quadratic programming via piecewise quadratic functions , 1999, Math. Program..