Éditeur(s) : HAL CCSD Hindawi Publishing Corporation
Résumé : International audience
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.
ISSN: 0161-1712

hal-00776654
https://hal.univ-antilles.fr/hal-00776654
https://hal.univ-antilles.fr/hal-00776654/document
https://hal.univ-antilles.fr/hal-00776654/file/305856.pdf
DOI : 10.1155/2011/305856

Éditeur(s) : HAL CCSD Academic Publishing Ltd
Résumé : International audience
An approximate procedure for solving the problem of nding a zero of a maximal monotone operator is proposed and its convergence is established under various conditions. More precisely, it is shown that this method weakly converges under natural assumptions and strongly converges provided that either the inverse of the involved operator is Lipschitz continuous around zero or the interior of the solution set is nonempty. A particular attention is given to the convex minimization case. AMS Subject Classication : Primary, 90C ; Secondary, 49M45, 65C.
ISSN: 1311-8080

hal-00779255
https://hal.univ-antilles.fr/hal-00779255
https://hal.univ-antilles.fr/hal-00779255/document
https://hal.univ-antilles.fr/hal-00779255/file/10.1.1.13.4261_3_.pdf

Éditeur(s) : HAL CCSD North Atlantic Science Publishing Company
Résumé : International audience
In this paper, we extend the sensitivity analysis framework developed recently for variational inequalities by Noor and Yen to variational inclusions relying on Wiener-Hopf equation techniques. We prove the continuity and the Lipschitz continuity of the locally unique solution to parametric variational inclusions without assuming differentiability of the given data.
ISSN: 1048-9533

hal-00779240
https://hal.univ-antilles.fr/hal-00779240
https://hal.univ-antilles.fr/hal-00779240/document
https://hal.univ-antilles.fr/hal-00779240/file/681979_4_.pdf

Éditeur(s) : HAL CCSD
Résumé : International audience
The author proposes a generalized proximal method for solving an equilibrium problem which consists in finding x 2 K such that F(x, y) 0, for all y 2 K, where K is a nonempty, convex and closed set of a real Hilbert space X, and F:K ×K !Ris a given bifunction with F(x, x) = 0 for all x 2 K. The weak convergence of the sequence generated by the method is proved under the assumptions of monotonicity and convexity, with respect to the second argument y (for every fixed x 2 K), of the bifunction F. Replacing the assumption of monotonicity with the one of strong monotonicity on F, a strong convergence result is obtained. A second strong convergence theorem is proved under the hypotheses of monotonicity and a new assumption of "co-Lipschitz continuity at 0" of the operator F. Applications to convex optimization, to the problem of finding a zero of a maximal monotone operator and to Nash equilibria problems are provided.
Journal of Natural Geometry

hal-00773194
https://hal.univ-antilles.fr/hal-00773194

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Relying on prox-regularity we suggest and analyze a class of iterative schemes for solving nonconvex variational inequalities, our result can be considered as an improvement and a significant extension of previously known results in this field.
ISSN: 0096-3003

hal-00780630
https://hal.univ-antilles.fr/hal-00780630
DOI : 10.1016/j.amc.2003.06.003

Éditeur(s) : HAL CCSD Taylor & Francis
Résumé : International audience
This article is concerned with a generalization of the hybrid steepest descent method from variational inequalities to the multivalued case. This will be reached by replacing the multivalued operator by its Yosida approximate, which is always Lipschitz continuous. It is worth mentioning that the hybrid steepest descent method is an algorithmic solution to variational inequality problems over the fixed point set of certain nonexpansive mappings and has remarkable applicability to the constrained nonlinear inverse problems like image recovery and MIMO communication systems
ISSN: 0163-0563

hal-00776641
https://hal.univ-antilles.fr/hal-00776641
DOI : 10.1080/01630563.2011.619676