skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Regularization of Nonmonotone Variational Inequalities

Abstract

In this paper we extend the Tikhonov-Browder regularization scheme from monotone to rather a general class of nonmonotone multivalued variational inequalities. We show that their convergence conditions hold for some classes of perfectly and nonperfectly competitive economic equilibrium problems.

Authors:
 [1];  [2];  [3]
  1. Department of Applied Mathematics, Kazan University, ul. Kremlevskaya 18, Kazan 420008 (Russian Federation), E-mail: Igor.Konnov@ksu.ru
  2. Department of Mathematics, Faculty of Education, Ain Shams University, Cairo (Egypt)
  3. Informatics Problems Institute of AS RT, Kazan 420012 (Russian Federation)
Publication Date:
OSTI Identifier:
21067421
Resource Type:
Journal Article
Resource Relation:
Journal Name: Applied Mathematics and Optimization; Journal Volume: 53; Journal Issue: 3; Other Information: DOI: 10.1007/s00245-005-0849-7; Copyright (c) 2006 Springer; www.springer-ny.com; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; CONVERGENCE; EQUILIBRIUM; VARIATIONAL METHODS

Citation Formats

Konnov, Igor V., Ali, M.S.S., and Mazurkevich, E.O. Regularization of Nonmonotone Variational Inequalities. United States: N. p., 2006. Web. doi:10.1007/S00245-005-0849-7.
Konnov, Igor V., Ali, M.S.S., & Mazurkevich, E.O. Regularization of Nonmonotone Variational Inequalities. United States. doi:10.1007/S00245-005-0849-7.
Konnov, Igor V., Ali, M.S.S., and Mazurkevich, E.O. Mon . "Regularization of Nonmonotone Variational Inequalities". United States. doi:10.1007/S00245-005-0849-7.
@article{osti_21067421,
title = {Regularization of Nonmonotone Variational Inequalities},
author = {Konnov, Igor V. and Ali, M.S.S. and Mazurkevich, E.O.},
abstractNote = {In this paper we extend the Tikhonov-Browder regularization scheme from monotone to rather a general class of nonmonotone multivalued variational inequalities. We show that their convergence conditions hold for some classes of perfectly and nonperfectly competitive economic equilibrium problems.},
doi = {10.1007/S00245-005-0849-7},
journal = {Applied Mathematics and Optimization},
number = 3,
volume = 53,
place = {United States},
year = {Mon May 15 00:00:00 EDT 2006},
month = {Mon May 15 00:00:00 EDT 2006}
}
  • The authors consider a class of Nonlinear Eigenvalue Problems (N.L.E.P.) associated with Elliptic Variational Inequalities (E.V.I.). First the authors introduce the main tools for a local study of branches of solutions; the authors extend the linearization process required in the case of equations. Next the authors prove the existence of arcs of solutions close to regular vs singular points, and determine their local behavior up to the first order. Finally, the authors discuss the connection between their regularity condition and some stability concept. 37 references, 6 figures.
  • We study the differential properties of weak solutions of evolution variational inequalities in the theory of flow of elastoplastic media with hardening. We consider the two most popular models of hardening-isotropic and kinematic. The differential properties studied depend on the nature of the hardening. In the case of isotropic hardening great smoothness of the distributed load is required, and in this situation the result is the same for the stress tensor-it belongs to the class L{sup {infinity}}(0,T; W{sup 1}{sub 2,loc}).
  • We study the properties of the method proposed in literature for solving variational inequalities and its modifications. Linear convergence in the neighborhood of the solution is established for problems that satisfy second-order sufficient conditions. The problem of finding the solution x{sub *} of the variational inequality (F(x{sub *}), x-x{sub *}) {ge} 0, {forall} x {element_of} {Omega} = (x{element_of}R{sup n}{vert_bar} f{sub i}(x){le}O, i=1,...,l) has been studied by many authors. The numerical methods considered by them, despite their theoretically fast rate of convergence, usually converge only locally and are computationally highly complex, because each iteration solves auxiliary subproblems on the original nonlinearmore » set {Omega}. In other methods, on the other hand, each iteration is efficiently executed and converges nonlocally to the solution, but we do not have the rate of convergence bounds which are typical for mathematical programming methods of the corresponding order.« less
  • For a class of variational inequalities on a Hilbert space H bifurcating solutions exist and may be characterized as critical points of a functional with respect to the intersection of the level surfaces of another functional and a closed convex subset K of H. In a recent paper (13) we have used a gradient-projection type algorithm to obtain the solutions for discretizations of the variational inequalities. A related but Newton-based method is given here. Global and asymptotically quadratic convergence is proved. Numerical results show that it may be used very efficiently in following the bifurcating branches and that is comparesmore » favorably with several other algorithms. The method is also attractive for a class of nonlinear eigenvalue problems (K = H) for which it reduces to a generalized Rayleigh-quotient interaction. So some results are included for the path following in turning-point problems.« less
  • Algorithms which utilize multiprocessing computers are considered for the numerical solution of variational inequalities. Parallel versions of the SOR algorithm with projection to the constraint set are carefully studied. One analysis assumes the matrix is a symmetric M-matrix and uses multisplitting and upper solutions to deduce convergence of the parallel algorithm. Another analysis uses the constrained minimization characterization of variational inequalities and P-regular multisplittings to obtain convergence. Numerical experiments were done on vector/multiprocessing computers. When using properly ordered multisplitting versions of SOR with projection to the constraint set, substantial speedups of the vector/multiprocessing codes relative to the serial code aremore » observed. Applications to fluid flow in a porous media and to a control problem are examined.« less