Related papers: Abstract convex optimal antiderivatives
The self-concordant-like property of a smooth convex function is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self-concordant-like property, this concept…
Let $X$ be a normed space of a finite dimension at least two, and $C\subsetneq X$ a closed convex set with nonempty interior. We are interested in extending Lipschitz quasiconvex functions on $C$ to quasiconvex functions on $X$. We show…
This paper deals with the study of parameter dependence of extensions of Lipschitz mappings from the point of view of continuity. We show that if assuming appropriate curvature bounds for the spaces, the multivalued extension operators that…
We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the data functions. In the convex case, the resulting formulas…
For an arbitrary set $E \subset \mathbb{R}^n$, and functions $f:E \to \mathbb{R}$, $G: E\to \mathbb{R}^n$ with $G$ bounded, we construct $C^1(\mathbb{R}^n)$ convex extensions $(F, \nabla F)$ of $(f,G)$ with the sharp Lipschitz constant $$…
Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this…
In this paper, we study convex analysis and its theoretical applications. We first apply important tools of convex analysis to Optimization and to Analysis. We then show various deep applications of convex analysis and especially infimal…
With the increasing interest in applying the methodology of difference-of-convex (dc) optimization to diverse problems in engineering and statistics, this paper establishes the dc property of many well-known functions not previously known…
Chapter 1 deals with the problem of the existence of an upper/lower envelope from a convex cone or, more generally, a convex set for functions on the projective limit of vector lattices with values in the completion of the Kantorovich space…
We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…
In this work, the notions of normal cones at infinity to unbounded sets and limiting and singular subdifferentials at infinity for extended real value functions are introduced. Various calculus rules for these notions objects are…
We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains $C$, with non-smooth boundary, in possibly non-compact manifolds. Assuming $C$ is a submanifold with corners, or…
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor expansion of the objective function, which leads to faster…
In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…
Our note is a complement to recent articles \cite{JS1} (2011) and \cite{JS2} (2013) by M. Jim\'enez-Sevilla and L. S\'anchez-Gonz\'alez which generalise (the basic statement of) the classical Whitney extension theorem for $C^1$-smooth real…
Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…
The paper is devoted to the study, characterizations, and applications of variational convexity of functions, the property that has been recently introduced by Rockafellar together with its strong counterpart. First we show that these…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…