Abstract
An approach to solving a mathematical program with variational inequality or nonlinear complementarity constraints is presented. It consists in a variational re-formulation of the optimization criterion and looking for a solution of thus obtained variational inequality among the points satisfying the initial variational constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Harker, P.T., Choi, S.-C., “A penalty function approach for mathematical programs with variational inequality constraints,” Information and Decision Technologies, 17 (1991), pp. 41–50.
Smith, M.J., “A descent algorithm for solving monotone variational inequalities and monotone complementarity problems,” Journal of Optimization Theory and Applications, 44 (1984), pp. 485–496.
Outrata, J.V., “On optimization problems with variational inequality constraints”, SIAM Journal on Optimization, 4 (1994), pp. 340–357.
Karamardian, S., “An existence theorem for the complementarity problem,” Journal of Optimization Theory and Applications, 18 (1976), pp. 445–454.
Eaves, B.C., “On the basic theorem of complementarity,” Mathematical Programming, 1 (1971), pp. 68–75.
Rockafellar, R.T., “Convex Analysis,” Princeton University Press, Princeton, New Jersey, 1970.
Harker, P.T., Pang, J.-S., “Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications,” Mathematical Programming, 48 (1990), pp. 161–220.
Author information
Authors and Affiliations
Additional information
This research was supported by the Russian Fundamental Research Foundation, Grant No. 93-012-842
Rights and permissions
About this article
Cite this article
Kalashnikov, V.V., Kalashinikova, N.I. Solving two-Level variational inequality. J Glob Optim 8, 289–294 (1996). https://doi.org/10.1007/BF00121270
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00121270