Related papers: Convex regularization and subdifferential calculus

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…

This article gives necessary and sufficient conditions for the dual representation of Rockafellar in (Integrals which are convex functionals. II, Pacific J. Math., 39:439--469, 1971) for integral functionals on the space of continuous…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

We investigate measures of complexity of function classes based on continuity moduli of Gaussian and Rademacher processes. For Gaussian processes, we obtain bounds on the continuity modulus on the convex hull of a function class in terms of…

In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…

The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…

We present new results on optimization problems where the involved functions are evenly convex. By means of a generalized conjugation scheme and the perturbation theory introduced by Rockafellar, we propose an alternative dual problem for a…

This work provides formulae for the $\epsilon$-subdifferential of integral functions in the framework of complete $\sigma$-finite measure spaces and locally convex spaces. In this work we present here new formulae for this…

We study the local and global versions of the convexity, which is closely related to the problem of extending a convex function on a non-convex domain to a convex function on the convex hull of the domain and beyond the convex hull. We also…

We construct valuations on the space of finite-valued convex functions using integration of differential forms over the differential cycle associated to a convex function. We describe the kernel of this procedure and show that the…

We study continuity and regularity of convex extensions of functions from a compact set $C$ to its convex hull $K$. We show that if $C$ contains the relative boundary of $K$, and $f$ is a continuous convex function on $C$, then $f$ extends…

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…

For an $(n\ge 2)$-dimensional real Banach space $E$ with unit ball $E_{\le 1}$ and a topological space $X$ arbitrary elements in $C(X,E_{\le 1})$ are always expressible as linear combinations of at most three functions valued in the unit…

Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x)…

Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…

We introduce notions of concavity for functions on balanced polyhedral spaces, and we show that concave functions on such spaces satisfy several strong continuity properties.

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…