É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
Résumé : International audience
We consider a second-order differential system with Hessian-driven damping . An interesting property of this system is that, after introduction of an auxiliary variable y , it can be equivalently written as a first-order system in time and space. This allows us to extend the analysis to the case of a convex lower semicontinuous potential and so to introduce constraints in the model. When considering the indicator function of a closed convex set, the subdifferential operator takes account of the contact forces. In this setting, by playing with the geometrical damping parameter, we can describe nonelastic shock laws with restitution coefficient. Taking advantage of the infinite dimensional framework, we introduce a nonlinear hyperbolic PDE describing a damped oscillating system with obstacle. The system is dissipative; in the convex case each trajectory weakly converges to a minimizer of the global potential energy function. Exponential stabilization is obtained under strong convexity assumptions.
Differential Equations & Applications

hal-00803214
https://hal.archives-ouvertes.fr/hal-00803214
https://hal.archives-ouvertes.fr/hal-00803214/document
https://hal.archives-ouvertes.fr/hal-00803214/file/Attouch-Mainge-Redont-30August2011.pdf

Éditeur(s) : HAL CCSD
Résumé : International audience
This paper deals with variational inclusions of the form 0 2 f(x) + g(x) K where f is smooth function from a re exive Banach space X into a Banach space Y , g is a Lipschitz function from X into Y and K is a nonempty closed convex cone in the space Y . We show that the previous problem can be solved by an extension of the Zincenko's method which can be seen as a perturbed Newton's method. Numerical results are given at the end of the paper.
Revista Investigacion Operacional

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

Éditeur(s) : HAL CCSD Taylor & Francis
Résumé : International audience
We provide an inequality relating the radial directional derivative and the subdifferential of proper lower semicontinuous functions, which extends the known formula for convex functions. We show that this property is equivalent to other subdifferential properties of Banach spaces, such as controlled dense subdifferentiability, optimality criterion, mean value inequality and separation principles. As an application, we obtain a first-order sufficient condition for optimality, which extends the known condition for differentiable functions in finite-dimensional spaces and which amounts to the maximal monotonicity of the subdifferential for convex lower semicontinuous functions. Finally, we establish a formula describing the subdifferential of the sum of a convex lower semicontinuous function with a convex inf-compact function in terms of the sum of their approximate epsilon-subdifferentials. Such a formula directly leads to the known formula relating the directional derivative of a convex lower semicontinuous function to its approximate epsilon-subdifferential.
ISSN: 0233-1934

hal-00694601
https://hal.archives-ouvertes.fr/hal-00694601
DOI : 10.1080/02331934.2011.645034

Éditeur(s) : HAL CCSD
Résumé : International audience
The main purpose of this note is to propose viscosity approximation methods which amount to selecting a particular fixed-point of a given nonexpansive self mapping in a general Hilbert space. The connection with the selection principles of Attouch, in the context of convex minimization and monotone inclusion problems, is made and an application to a semi-coercive elliptic problem is then stated. Key words: nonexpansive mappings, fixed-points, monotone operators, iterative methods, convex optimization, selection, penalty ...
Lecture notes in economics and mathematical systems

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

É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é : International audience
This paper deals with variational inclusions of the form 0 ∈ K − f(x) − g(x) where f is a smooth function from a reflexive Banach space X into a Banach space Y , g is a function from X into Y admitting divided differences and K is a nonempty closed convex cone in the space Y . We show that the previous problem can be solved by a combination of two methods: the Newton and the Secant methods. We show that the order of the semilocal method obtained is equal to (1 + √5)/2. Numerical results are also given to illustrate the convergence at the end of the paper.
Serdica Math. J.

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

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Let H1,H2,H3 be real Hilbert spaces, let C⊂H1, Q⊂H2 be two nonempty closed convex level sets, let A:H1→H3, B:H2→H3 be two bounded linear operators. Our interest is in solving the following new convex feasibility problem Find x∈C,y∈Q such that Ax=By, which allows asymmetric and partial relations between the variables x and y. In this paper, we present and study the convergence of a relaxed alternating CQ-algorithm (RACQA) and show that the sequences generated by such an algorithm weakly converge to a solution of (1.1). The interest of RACQA is that we just need projections onto half-spaces, thus making the relaxed CQ-algorithm implementable. Note that, by taking B=I, in (1.1), we recover the split convex feasibility problem originally introduced in Censor and Elfving (1994) [13] and used later in intensity-modulated radiation therapy (Censor et al. (2006) [11]). We also recover the relaxed CQ-algorithm introduced by Yang (2004) [8] by particularizing both B and a given parameter.
ISSN: 0362-546X

hal-00776638
https://hal.univ-antilles.fr/hal-00776638
DOI : 10.1016/j.na.2012.11.013

Éditeur(s) : HAL CCSD IOP Publishing
Résumé : International audience
Based on the very recent work by Censor and Segal (2009 J. Convex Anal. 16 587-600) and inspired by Xu (2006 Inverse Problems 22 2021-34) and Yang (2004 Inverse Problems 20 1261-6), we investigate an algorithm for solving the split common fixed-point problem for the class of demicontractive operators in a Hilbert space. Our results improve and/or develop previously discussed feasibility problems and related algorithms. It is worth mentioning that the convex feasibility formalism is at the core of the modeling of many inverse problems and has been used to model significant real-world problems, for instance, in sensor networks, in radiation therapy treatment planning, in computerized tomography and data compression, see Censor et al (2006 Phys. Med. Biol. 51 2353-65) and Combettes (1996 Adv. Imaging Electron. Phys. 95 155-270) and references therein.
ISSN: 0266-5611

hal-00778174
https://hal.univ-antilles.fr/hal-00778174
DOI : 10.1088/0266-5611/26/5/055007

Éditeur(s) : HAL CCSD American Mathematical Society
Résumé : International audience
We define an abstract notion of subdifferential operator and an associated notion of smoothness of a norm covering all the standard situations. In particular, a norm is smooth for the Gâteaux (Fréchet, Hadamard, Lipschitz-smooth) subdifferential if it is Gâteaux (Fréchet, Hadamard, Lipschitz) smooth in the classical sense, while on the other hand any norm is smooth for the Clarke-Rockafellar subdifferential. We then show that lower semicontinuous functions on a Banach space satisfy an Approximate Mean Value Inequality with respect to any subdifferential for which the norm is smooth, thus providing a new insight on the connection between the smoothness of norms and the subdifferentiability properties of functions. The proof relies on an adaptation of the ''smooth'' variational principle of Borwein-Preiss. Along the same vein, we derive subdifferential criteria for coercivity, Lipschitz behavior, cone-monotonicity, quasiconvexity, and convexity of lower semicontinuous functions which clarify, unify and extend many existing results for specific subdifferentials.
ISSN: 0002-9947

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

É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 Taylor & Francis
Résumé : International audience
ISSN: 0233-1934

hal-00816722
https://hal.univ-antilles.fr/hal-00816722
DOI : 10.1080/02331939408843968

Éditeur(s) : HAL CCSD Society for Industrial and Applied Mathematics
Résumé : International audience
We present iterative methods for finding the critical points and/or the minima of extended real valued functions of the form $phi = psi+ g-h$, where $psi$ is a differentiable function and g and h are convex, proper, and lower semicontinuous. The underlying idea relies upon the discretization of a first order dissipative dynamical system which allows us to preserve the local feature and to obtain some convergence results. The main theorems not only recover known convergence results in this field but also provide a theoretical basis for the development of new iterative methods.
ISSN: 1052-6234

hal-00779987
https://hal.univ-antilles.fr/hal-00779987
DOI : 10.1137/060655183

Éditeur(s) : HAL CCSD
Résumé : International audience
We show that the properties of dense subdifferentiability and of trustworthiness are equivalent for any subdifferential satisfying a small set of natural axioms. The proof relies on a remarkable property of the subdifferential of the inf-convolution of two (non necessarily convex) functions. We also show the equivalence of the dense subdifferentiability property with other basic properties of subdifferentials such as a weak∗ Lipschitz Separation property, a strong Compact Separation property and a Minimal property for the analytic approximate subdifferential of Ioffe.
Serdica. Mathematical Journal

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

É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 Springer Verlag
Résumé : International audience
We investigate the existence of several kinds of prederivatives for set-valued mappings enjoying convex properties. Then, we established both necessary and sufficient optimality conditions, involving such prederivatives, for set optimization problems.
ISSN: 0925-5001

hal-01172386
https://hal.archives-ouvertes.fr/hal-01172386
DOI : 10.1007/s10898-015-0338-8

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
We introduce the Convex Circuit-Free coloration and Convex Circuit-Free chromatic numberView the MathML source of an oriented graph View the MathML source and establish various basic results. We show that the problem of deciding if an oriented graph verifies View the MathML source is NP-complete if k≥3, and polynomial if k≤2. We introduce an algorithm which finds the optimal convex circuit-free coloration for tournaments, and characterize the tournaments that are vertex-critical for the convex circuit-free coloration.
ISSN: 0195-6698

hal-00716574
https://hal.archives-ouvertes.fr/hal-00716574
DOI : 10.1016/j.ejc.2008.02.012

É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 Society for Industrial and Applied Mathematics
Résumé : International audience
We establish a general Fermat rule for the problem of minimizing a lower semicontinuous function on a convex subset of a Banach space. Our basic tool is a constrained variational principle derived from the "smooth" variational principle of Borwein and Preiss. Specializing the Fermat rule to the case when the convex set is a "drop," we obtain a multidirectional Rolle-type inequality from which, in turn, we deduce a multidirectional mean value inequality, in the line of Clarke and Ledyaev. We follow the abstract approach of our previous paper [Trans. Amer. Math. Soc., 347 (1995), pp. 4147-4161], thus covering all standard situations met in applications, while stressing the links between the results and the few key properties that are needed.
ISSN: 1052-6234

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

É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