A Penalization-Gradient Algorithm for Variational Inequalities

Abdellatif Moudafi and Eman Al-Shemas

International Journal of Mathematics and Mathematical Sciences, 2011, vol. 2011, 1-12

Abstract:

This paper is concerned with the study of a penalization-gradient algorithm for solving variational inequalities, namely, find such that for all , where is a single-valued operator, is a closed convex set of a real Hilbert space . Given which acts as a penalization function with respect to the constraint , and a penalization parameter , we consider an algorithm which alternates a proximal step with respect to and a gradient step with respect to and reads as . Under mild hypotheses, we obtain weak convergence for an inverse strongly monotone operator and strong convergence for a Lipschitz continuous and strongly monotone operator. Applications to hierarchical minimization and fixed-point problems are also given and the multivalued case is reached by replacing the multivalued operator by its Yosida approximate which is always Lipschitz continuous.

Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2011/305856.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2011/305856.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:jijmms:305856

DOI: 10.1155/2011/305856

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().