Skip Navigation Links
Discontinuity, Nonlinearity, and Complexity

Dimitry Volchenkov (editor), Dumitru Baleanu (editor)

Dimitry Volchenkov(editor)

Mathematics & Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409, USA


Dumitru Baleanu (editor)

Cankaya University, Ankara, Turkey; Institute of Space Sciences, Magurele-Bucharest, Romania


Iterative Method for Non-Stationary Mixed Variational Inequalities

Discontinuity, Nonlinearity, and Complexity 9(4) (2020) 647--655 | DOI:10.5890/DNC.2020.12.015


Department of Mathematics, Jazan University, Jazan-45142, Kingdom of Saudi Arabia

Download Full Text PDF



We consider a non-stationary mixed variational inequality problem involving an integrable mapping and a convex function, where only approximation sequences are known instead of exact values of the cost mapping and function, and feasible set. We apply a descent method and partial penalization to prove the convergence is attained without concordance of penalty, accuracy, and approximation parameters under coercivity type conditions.


  1. [1]  Patriksson, M. (1999), Nonlinear Programming and Variational Inequality Problems: A Unified Approach. Kluwer Academic Publishers, Dordrecht.
  2. [2]  Malisani, P., Chaplais, F., and Petit, N. (2012), A constractive interior penalty method for optimal control problems with state and input constraints. 2012 American Control Conference, Fairmont Queen Elizabeth, Montreal, Canada, June 27.
  3. [3]  Zhou, H. and Lange, K. (2015), Path following in the exact penalty method of convex programming, Comput. Optim. Appl., 61, 609-634.
  4. [4]  Salahuddin (2015), Descent techniques for generalized equilibrium problems, Trans. Math. Prog. Appl., 3(2), 30--39.
  5. [5]  Alart, P. and Lemaire, B. (1991), Penalization in non-classical convex programming via variational convergence, Math. Program., 51, 307--331.
  6. [6]  Cominetti, R. (1997), Coupling the proximal point algorithm with approximation methods, J. Optim. Theory Appl., 95, 581-600.
  7. [7]  Gwinner, J. (1983), On the penalty method for constrained variational inequalities. Optimization:Theory and algorithms (Confolant, 1981) Lecture Notes in Pure and Appl. Math. Vil. 86, 197-211.
  8. [8]  Antipin, A.S. and Vasil'ev, F.P. (1999), A stabilization method for equilibrium programming problems with an approximately given set, Comput. Math. Math. Phys., 39, 1707-1714.
  9. [9]  Salmon, G., Nguyen, V.H., and Strodiot, J.J. (2000), Coupling the auxiliary problem principle and epiconvergence theory for solving general variational inequalities, J. Optim. Theory Appl., 104, 629-657.
  10. [10]  Kaplan, A. and Tichatschke, R. (2001), A general view on proximal point methods for variational inequalities in Hilbert spaces, J. Nonl. Conv. Anal., 2, 305-332.
  11. [11]  Konnov, I.V. (2013), Application of penalty methods to non-stationary variational inequalities, Nonl. Anal.: Theory, Methods and Appl., 92, 177-182.
  12. [12]  Konnov, I.V. (2014), Application of the penalty method to nonstationary approximation of an optimization problem, Russian Math. (Iz. VUZ)., 58, 49-55.
  13. [13]  Konnov, I.V. (2015), An inexact penalty method for non stationary generalized variational inequalities, Set-Valued Var. Anal., 23, 239-248.
  14. [14]  Fukushima, M. and Mine, H. (1981), A generalized proximal point algorithm for certain non-convex minimization problems, Intern. J. Syst. Sci., 12, 989-1000.
  15. [15]  Patriksson, M. (1998), Cost approximation: a unified framework of descent algorithms for nonlinear programs, SIAM J. Optim., 8, 561-582.
  16. [16]  Konnov, I.V. (2013), Nonlinear Optimization and Variational Inequalities, Kazan Univ. Press, Kazan, 2013. [In Russian].