A penalization-gradient algorithm for variational inequalities

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.univ-antilles.fr/hal-00776654
Contributor : Pamphile Isch <>
Submitted on : Tuesday, January 15, 2013 - 9:34:22 PM
Last modification on : Wednesday, July 18, 2018 - 8:11:27 PM
Long-term archiving on : Saturday, April 1, 2017 - 5:49:10 AM

File

305856.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Abdellatif Moudafi, Eman Al-Shemas. A penalization-gradient algorithm for variational inequalities. International Journal of Mathematics and Mathematical Sciences, Hindawi Publishing Corporation, 2011, pp.1-12. ⟨10.1155/2011/305856⟩. ⟨hal-00776654⟩

Share

Metrics

Record views

190

Files downloads

190