Publications

International audience

International audience

This article deals with systems of infinitely many inequalities involving functions that are positively homogeneous over a nonempty convex cone of the Euclidean space. Generalized convex conjugation theory is applied to derive a Farkas-type and a Gale-type theorem for this kind of systems. These results are particularized for linear and min-type inequality systems.

We present some results extending d.c. duality theory to the generalized convex setting.Given a binary operation ∗ on the extended real line, we consider the problem of minimizingƒ∗–hwithƒ and h being functions defined on an arbitrary set. For this problem. we obtain results which encompass, as particular cases, some well known duality theorems for the infimum of the difference of two functions and the infimum of the maximum of two functions, as well as some well known formulae for the conjugate of the difference of two functions and the conjugate of type Lau of the maximum of two functions. Instead of considering the Fenchel conjugation operator, our results are expressed with the aid of dualities which are associated to the operation ∗.We also study. for such dualities, the corresponding generalized subdifferential

We present a generalization of the strong Fitzpatrick inequality in the context of reflexive Banach spaces, involving a twisted bigger conjugate function. We also introduce a related family of gap functions for maximal monotone inclusion problems.

In this article, we study increasing and positively homogeneous functions defined on convex cones of locally convex spaces. This work is the first part in a series of studies to have a general view of the emerging area of Monotonic Analysis. We develop a general notion of so-called elementary functions, so that the generalized increasing and positively homogeneous functions can be represented as upper-envelopes of families of such functions. We also study many other associated properties like the description of support sets and normal and co-normal sets in a very general setting.

The aim of this paper is twofold. On one hand the generalized Minkowski sets are defined and characterized. On the other hand, the Motzkin decomposable sets, along with their epigraphic versions are considered and characterized in new ways. Among them, the closed convex sets with one single minimal face, i.e. translated closed convex cones, along with their epigraphic counterparts are particularly studied.

This paper is focused on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it shows that operators that are simultaneously paramonotone and bimonotone are constant on their domains, and this fact is applied to tackle two particular situations. The first one, closely related to simultaneous projections, deals with a finite amount of convex sets with an empty intersection and tackles the problem of finding the smallest perturbations (in the sense of translations) of these sets to reach a nonempty intersection. The second is focused on the distance to feasibility; specifically, given an inconsistent convex inequality system, our goal is to compute/estimate the smallest right-hand side perturbations that reach feasibility. We advance that this work derives lower and upper estimates of such a distance, which become the exact value when confined to linear systems.

We present a model of learning in which agents learn from errors. If an action turns out to be an error, the agent rejects not only that action but also neighboring actions. We find that, keeping memory of his errors, under mild assumptions an acceptable solution is asymptotically reached. Moreover, one can take advantage of big errors for a faster learning.

Abstract The main result is an equality type mean value theorem for tangentially convex functions in terms of tangential subdifferentials, which generalizes the classical one for differentiable functions, as well as Wegge theorem for convex functions. The new mean value theorem is then applied, analogously to what is done in the classical case, to characterize, in the tangentially convex context, Lipschitz functions, increasingness with respect to the ordering induced by a closed convex cone, convexity, and quasiconvexity.

The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order Voronoi cells and illustrate our theoretical findings with a case study of two-dimensional higher-order Voronoi cells for four points.