Résumé : Cette thèse est consacrée à la résolution d'un problème fondamental de l'analyse variationnelle qu'est la recherchede zéros d'opérateurs maximaux monotones dans un espace de Hilbert. Nous nous sommes tout d'abord intéressés au cas de l'opérateur somme étendue de deux opérateurs maximaux monotones; la recherche d'un zéro de cet opérateur est un problème dont la bibliographie est peu fournie: nous proposons une version modifiée de l'algorithme d'éclatement forward-backward utilisant à chaque itération, l'epsilon-élargissement d'un opérateur maximal monotone,afin de construire une solution. Nous avons ensuite étudié la convergence d'un nouvel algorithme de faisceaux pour construire ID zéro d'un opérateur maximal monotone quelconque en dimension finie. Cet algorithme fait intervenir une double approximation polyédrale de l'epsilon-élargissement de l'opérateur considéré
This thesis is devoted to solving a basic problem of variational analysis which is the search of zeros of maximal monotone operators in a Hilbert space. First of aIl, we concentrate on the case of the extended som of two maximal monotone operators; the search of a zero of this operator is a problem for which the bibliography is not abondant: we purpose a modified version of the forward-backward splitting algorithm using at each iteration, the epsilon-enlargement of a maximal monotone operator, in order to construet a solution. Secondly, we study the convergence of a new bondie algorithm to construet a zero of an arbitrary maximal monotone operator in a finite dimensional space. In this algorithm, intervenes a double polyhedral approximation of the epsilon-enlargement of the considered operator

http://www.theses.fr/2012AGUY0548/document

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
The aim of this paper is to investigate the asymptotic behavior of an inertial alternating algorithm based on the composition of resolvents of monotone operators. The proposed algorithm is a generalization of those proposed in Attouch et al. (2007) and Bauschke et al. (2005). As a special case, we also recover the classical alternating minimization algorithm (Acker, 1980), which itself is a natural extension of the alternating projection algorithm of von Neumann (1950) [4]. An application to equilibrium problems is also proposed.
ISSN: 0893-9659

hal-00776658
https://hal.univ-antilles.fr/hal-00776658
DOI : 10.1016/j.aml.2010.01.023

Éditeur(s) : HAL CCSD Springer Verlag
Résumé : International audience
We show that the lower limit of a sequence of maximal monotone operators on a reflexive Banach space is a representable monotone operator. As a consequence, we obtain that the variational sum of maximal monotone operators and the variational composition of a maximal monotone operator with a linear continuous operator are both representable monotone operators.
ISSN: 0927-6947

hal-00698802
https://hal.archives-ouvertes.fr/hal-00698802

Éditeur(s) : HAL CCSD Heldermann
Résumé : International audience
We study extended notions for sums of monotone operators and for precompositions of monotone operators with continuous linear mappings. First, we establish some new properties related to the notion of extended sum recently proposed by Revalski and Théra, among them the monotonicity of this sum provided the operators involved are maximal monotone. Then, we show that the equivalence which exists between usual sums and compositions remains valid also for the extended operations. This allows us to obtain some known and new results for extended compositions via the corresponding properties of extended sums.
Journal of Convex Analysis

hal-00698807
https://hal.archives-ouvertes.fr/hal-00698807

Éditeur(s) : HAL CCSD EDP Sciences
Résumé : International audience
In the setting of a real Hilbert space H, we investigate the asymptotic behavior, as time t goes to infinity, of trajectories of second-order damped evolution equations, which are governed by the sum of the gradient operator of a convex differentiable potential function , and a maximal monotone operator which is assumed to be cocoercive. Under a sharp condition involving the viscous and the cocoercive parameters, it is proved that each trajectory weakly converges to an equilibrium. Passing from weak to strong convergence is obtained by introducing an asymptotically vanishing Tikhonov-like regularizing term. As special cases, we recover the asymptotic analysis of the heavy ball with friction dynamic attached to a convex potential, the second-order gradient-projection dynamic, and the second-order dynamic governed by the Yosida approximation of a general maximal monotone operator. The breadth and flexibility of the proposed framework is illustrated through applications in the areas of constrained optimization, dynamical approach to Nash equilibria for noncooperative games, and asymptotic stabilization in the case of a continuum of equilibria.
ISSN: 1292-8119

hal-00803774
https://hal.archives-ouvertes.fr/hal-00803774
https://hal.archives-ouvertes.fr/hal-00803774/document
https://hal.archives-ouvertes.fr/hal-00803774/file/ATTOUCH-MAINGE-09-04-2010-COCV.pdf
DOI : 10.1051/cocv/2010024

Éditeur(s) : HAL CCSD
Résumé : International audience
The paper deals with iterative schemes for finding a zero of a maximal monotone operator. A combination of the auxiliary principle with the Tikhonov method is considered. Under some assumptions the sequence generated by such an iterative scheme is shown to converge to a solution of the problem that is required to satisfy an associated variational inequality
Lecture notes in economics and mathematical systems

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

Éditeur(s) : HAL CCSD Taylor & Francis
Résumé : International audience
An approximation method which combines Tikhonov method with the proximal point algorithm, is presented. Conditions which guarantee the convergence to a particular element of the solution set, are provided. A particular attention is given to the convex and convex-concave optimization cases.
ISSN: 0233-1934

hal-00815513
https://hal.univ-antilles.fr/hal-00815513
DOI : 10.1080/02331939608844217

Éditeur(s) : HAL CCSD Springer Verlag
Résumé : International audience
We provide a first-order necessary and sufficient condition for optimality of lower semicontinuous functions on Banach spaces using the concept of subdifferential. From the sufficient condition we derive that any subdifferential operator is monotone absorbing, hence maximal monotone when the function is convex.
ISSN: 0925-5001

hal-00761658
https://hal.archives-ouvertes.fr/hal-00761658
ARXIV : 1212.0532
DOI : 10.1007/s10898-013-0078-6

Éditeur(s) : HAL CCSD
Résumé : In this note we show that the splitting scheme of Passty [7] as well as the barycentric-proximal method of Lehdili & Lemaire [4] can be used to approximate a zero of the extended sum of maximal monotone operators. When the extended sum is maximal monotone, we extend the convergence result obtained by Lehdili & Lemaire for convex functions to the case of maximal monotone operators. Moreover, we recover the main convergence results by Passty and Lehdili & Lemaire when the pointwise sum of the involved operators is maximal monotone.
https://hal.univ-antilles.fr/hal-00783905

hal-00783905
https://hal.univ-antilles.fr/hal-00783905
https://hal.univ-antilles.fr/hal-00783905/document
https://hal.univ-antilles.fr/hal-00783905/file/10.1.1.165.7044.pdf

Éditeur(s) : HAL CCSD Bulgarian Academy of Sciences
Résumé : International audience
Using monotone bifunctions, we introduce a recession concept for general equilibrium problems relying on a variational convergence notion. The interesting purpose is to extend some results of P. L. Lions on variational problems. In the process we generalize some results by H. Brezis and H. Attouch relative to the convergence of the resolvents associated with maximal monotone operators.
Serdica Mathematical Journal

Droits : info:eu-repo/semantics/OpenAccess
hal-00776626
https://hal.univ-antilles.fr/hal-00776626
https://hal.univ-antilles.fr/hal-00776626/document
https://hal.univ-antilles.fr/hal-00776626/file/sjm-vol26-num3-2000-207p-220p.pdf

Éditeur(s) : HAL CCSD School of Communications and Informatics
Résumé : International audience
The hybrid proximal point algorithm introduced by Solodov and Svaiter allowing significant relaxation of the tolerance requirements imposed on the solution of proximal subproblems will be combined with the inertial method introduced by Alvarez and Attouch which incorporates second order information to achieve faster convergence. The weak convergence of the resulting method will be investigated for finding zeroes of a maximal monotone operator in a Hilbert space.
ISSN: 1443-5756

hal-00780745
https://hal.univ-antilles.fr/hal-00780745
https://hal.univ-antilles.fr/hal-00780745/document
https://hal.univ-antilles.fr/hal-00780745/file/170_03_www.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
ISSN: 0362-546X

hal-00816761
https://hal.univ-antilles.fr/hal-00816761
DOI : 10.1016/0362-546X(93)90065-Z

Éditeur(s) : HAL CCSD Taylor & Francis
Résumé : International audience
The aim of this note consists in studying the solvability of the following problem find xA such that yT(x) T is a maximal monotone operator and A a subspace of a real Hilbert space H.
ISSN: 0163-0563

hal-00779243
https://hal.univ-antilles.fr/hal-00779243
DOI : 10.1080/01630569508816642

Éditeur(s) : HAL CCSD
Résumé : In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use of the transportation formula. Moreover, the use of a double polyhedral approximation in our algorithm could inspire other bundle methods for the case where the given operator can be split as the sum of two other maximal monotone operators.
https://hal.archives-ouvertes.fr/hal-00828930

hal-00828930
https://hal.archives-ouvertes.fr/hal-00828930
ARXIV : 1305.5810

É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 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 Elsevier
Résumé : International audience
We propose an extended forward-backward algorithm for approximating a zero of a maximal monotone operator which can be split as the extended sum of two maximal monotone operators. We establish the weak convergence in average of the sequence generated by the algorithm under assumptions similar to those used in classical forward-backward algorithms. This provides as a special case an algorithm for solving convex constrained minimization problems without qualification condition.
Journal of Mathematical Analysis and applications

hal-00761657
https://hal.archives-ouvertes.fr/hal-00761657
ARXIV : 1212.0523
DOI : 10.1016/j.jmaa.2013.02.022

Éditeur(s) : HAL CCSD
Résumé : International audience
An iterative method for solving set-valued variational inequalities is considered and its convergence properties are studied under strong monotonicity and coercivity conditions. The results obtained in this paper include, as a special case, some known results in this field.
Mathematical Inequalities & Applications

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

Éditeur(s) : HAL CCSD
Résumé : International audience
Relying on an idea of T. Pennanen, we use a localized version of maximal hypomonotonicity, and prove that it is enough to guarantee the local convergence of the Tikhonov regularization. In the process, we revisit this method which together with the help of the analysis developed by T. Pennanen allows us to obtain the desired result.
Mathematical Inequalities and Apllications

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