Related papers: Random convex analysis (II): continuity and subdif…
We establish how a higher local field can be described as a locally convex vector space once an embedding of a local field into it has been fixed. This extends previous results that had been obtained in the two-dimensional case. In…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
Bilevel programs are optimization problems where some variables are solutions to optimization problems themselves, and they arise in a variety of control applications, including: control of vehicle traffic networks, inverse reinforcement…
Let $L^0$ be the vector space of all (equivalence classes of) real-valued random variables built over a probability space $(\Omega, \mathcal{F}, P)$, equipped with a metric topology compatible with convergence in probability. In this work,…
Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…
Several results in functional analysis are extended to the setting of $L^0$-modules, where $L^0$ denotes the ring of all measurable functions $x\colon \Omega\to \mathbb{R}$. The focus is on results involving compactness. To this end, a…
In this article, we propose a novel characterization of law-invariant and coherent risk measures, based on a generalized optimal transport problem in which the second marginal of the admissible plans is not fixed, but required to lie within…
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…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…
A fruitful idea, when providing subdifferential formulae and dual representations for convex risk measures, is to make use of the conjugate duality theory in convex optimization. In this paper we underline the outstanding role played by the…
Motivated by recent developments on calculus in metric measure spaces $(X,\mathsf d,\mathfrak m)$, we prove a general duality principle between Fuglede's notion of $p$-modulus for families of finite Borel measures in $(X,\mathsf d)$ and…
This paper suggests two novel ideas to develop new proximal variable-metric methods for solving a class of composite convex optimization problems. The first idea is a new parameterization of the optimality condition which allows us to…
We expose a theoretical hedging optimization framework with variational preferences under convex risk measures. We explore a general dual representation for the composition between risk measures and utilities. We study the properties of the…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
In this paper, we embed each $L^\infty$-normed module $E$ into an appropriate and unique complete random normed module $E_0$ so that the properties of $E$ are closely related to the properties of $E_0$.
We study differentiability properties of convex operators defined on a Banach space with values in an $\Lc_p$ space and of their compositions with monotonic convex functionals on this space. We develop new tools for operators enjoying an…
For an extended locally convex space $(X,\tau)$, in [8], the authors studied the finest locally convex topology (flc topology) $\tau_F$ on $X$ coarser than $\tau$. One can often prove facts about $(X, \tau)$ by applying classical locally…
We present various approaches to J. Herzog's theory of generalized local cohomology and explore its main aspects, e.g., (non-)vanishing results as well as a general local duality theorem which extends, to a much broader class of rings,…
Duality is a foundational tool in robust and distributionally robust optimization (RO and DRO), underpinning both analytical insights and tractable reformulations. The prevailing approaches in the literature primarily rely on saddle-point…