A penalization-gradient algorithm for variational inequalities - Université des Antilles Accéder directement au contenu
Article Dans Une Revue International Journal of Mathematics and Mathematical Sciences Année : 2011

A penalization-gradient algorithm for variational inequalities

Résumé

This paper is concerned with the study of a penalization-gradient algorithmfor solving variational inequalities, namely, find x ∈ C such that Ax, y − x ≥ 0 for all y ∈ C, where A : H → H is a single-valued operator, C is a closed convex set of a real Hilbert space H. Given Ψ : H → ∪ { ∞} which acts as a penalization function with respect to the constraint x ∈ C, and a penalization parameter βk, we consider an algorithm which alternates a proximal step with respect to ∂Ψ and a gradient step with respect to A and reads as xk I λkβk∂Ψ −1 xk−1 − λkAxk−1 . 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 themultivalued operator by its Yosida approximatewhich is always Lipschitz continuous.
Fichier principal
Vignette du fichier
305856.pdf (117.58 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00776654 , version 1 (15-01-2013)

Identifiants

Citer

Abdellatif Moudafi, Eman Al-Shemas. A penalization-gradient algorithm for variational inequalities. International Journal of Mathematics and Mathematical Sciences, 2011, pp.1-12. ⟨10.1155/2011/305856⟩. ⟨hal-00776654⟩
111 Consultations
181 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More