IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v97y1998i1d10.1023_a1022687403403.html
   My bibliography  Save this article

On a General Projection Algorithm for Variational Inequalities

Author

Listed:
  • L. C. Zeng

    (Shanghai Normal University
    Shanghai Fudan University)

Abstract

Let H be a real Hilbert space with norm and inner product denoted by $$|| \cdot ||$$ and $$\left\langle { \cdot, \cdot } \right\rangle$$ . Let K be a nonempty closed convex set of H, and let f be a linear continuous functional on H. Let A, T, g be nonlinear operators from H into itself, and let $$K(\cdot):H \to 2^H$$ be a point-to-set mapping. We deal with the problem of finding uɛK such that g(u)ɛK(u) and the following relation is satisfied: $$\left\langle {A\left( {g\left( u \right)} \right),{\upsilon } - g\left( u \right)} \right\rangle \geqslant \left\langle {A\left( u \right),{\upsilon } - g\left( u \right)} \right\rangle - p\left\langle {T\left( u \right) - f,\upsilon - g\left( u \right)} \right\rangle \forall {\upsilon } \in K\left( u \right)$$ , where ρ>0 is a constant, which is called a general strong quasi-variational inequality. We give a general and unified iterative algorithm for finding the approximate solution to this problem by exploiting the projection method, and prove the existence of the solution to this problem and the convergence of the iterative sequence generated by this algorithm.

Suggested Citation

  • L. C. Zeng, 1998. "On a General Projection Algorithm for Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 97(1), pages 229-235, April.
  • Handle: RePEc:spr:joptap:v:97:y:1998:i:1:d:10.1023_a:1022687403403
    DOI: 10.1023/A:1022687403403
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022687403403
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1022687403403?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:97:y:1998:i:1:d:10.1023_a:1022687403403. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.