Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets

Songnian He and Caiping Yang

Abstract and Applied Analysis, 2013, vol. 2013, 1-8

Abstract:

Consider the variational inequality of finding a point satisfying the property , for all , where is the intersection of finite level sets of convex functions defined on a real Hilbert space and is an -Lipschitzian and -strongly monotone operator. Relaxed and self-adaptive iterative algorithms are devised for computing the unique solution of . Since our algorithm avoids calculating the projection (calculating by computing several sequences of projections onto half-spaces containing the original domain ) directly and has no need to know any information of the constants and , the implementation of our algorithm is very easy. To prove strong convergence of our algorithms, a new lemma is established, which can be used as a fundamental tool for solving some nonlinear problems.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2013/942315.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2013/942315.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:942315

DOI: 10.1155/2013/942315

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().