Éditeur(s) : HAL CCSD
Résumé : International audience
To solve general variational inequalities considered in Robinson [9], we propose a generalized version of an algorithm introduced by Bermudez and Moreno [3]. Our results extend, improve and develop some known results in this field.
Advanced Modeling and Optimization

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

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Two splitting procedures for solving equilibrium problems involving the sum of two bifunctions are proposed and their convergence is established under mild assumptions.
Journal of Mathematical Analysis and applications

hal-00779982
https://hal.univ-antilles.fr/hal-00779982
DOI : 10.1016/j.jmaa.2009.06.005

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Relying on the Yosida approximate, we investigate the problem of finding zeroes for a difference of two maximal monotone operators in Hilbert spaces. These zeroes are compared to those of the corresponding regularized and dual problems. The behavior of the regularized operator is also studied and a splitting algorithm involving the resolvents of both operators is suggested via a fixed-point formulation of the regularized problem. A particular attention is given to the DC programming case.
ISSN: 0096-3003

hal-00779986
https://hal.univ-antilles.fr/hal-00779986
DOI : 10.1016/j.amc.2008.01.024

Éditeur(s) : HAL CCSD
Résumé : The convex feasibility problem (CFP) is to find a member of the intersection of finitely many closed convex sets in Euclidean space. When the intersection is empty, one can minimize a proximity function to obtain an approximate solution to the problem. The split feasibility problem (SFP) and the split equality problem (SEP) are generalizations of the CFP. The approximate SFP (ASFP) and approximate SEP (ASEP) involve finding only approximate solutions to the SFP and SEP, respectively. We present here the SSEA, a simultaneous iterative algorithm for solving the ASEP. When this algorithm is applied to the ASFP it resembles closely, but is not equivalent to, the CQ algorithm. The SSEA involves orthogonal projection onto the given closed convex sets. The relaxed SSEA (RSSEA) is an easily implementable variant of the SSEA that uses orthogonal projection onto half-spaces at each step to solve the SEP. The perturbed version of the SSEA (PSSEA) is similar to the RSSEA, but uses orthogonal projection onto a sequence of epi-convergent closed convex sets.
https://hal.univ-antilles.fr/hal-00776640

Droits : info:eu-repo/semantics/OpenAccess
hal-00776640
https://hal.univ-antilles.fr/hal-00776640
https://hal.univ-antilles.fr/hal-00776640/document
https://hal.univ-antilles.fr/hal-00776640/file/CBAM10.pdf

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
A forward-backward inertial procedure for solving the problem of finding a zero of the sum of two maximal monotone operators is proposed and its convergence is established under a cocoercivity condition with respect to the solution set.
ISSN: 0377-0427

hal-00780778
https://hal.univ-antilles.fr/hal-00780778
https://hal.univ-antilles.fr/hal-00780778/document
https://hal.univ-antilles.fr/hal-00780778/file/10.1.1.12.4189.pdf
DOI : 10.1016/S0377-0427(02)00906-8