相关论文: Max-plus convex sets and functions

We show that a profinite completion functor for (simplicial or topological) operads with good homotopical properties can be constructed as a left Quillen functor from an appropriate model category of infinity-operads to a certain model…

Exhausters are families of convex compact sets that allow one to represent directional derivative of the studied function at the considered point in the form of InfMax or SupMin of linear functions. Functions for which such a representation…

In this paper we introduce a model theoretic construction for the theories of uniform layered domains and semifields introduced in the paper of Izhakian, Knebusch and Rowen. We prove that, for a given layering semiring L, the theory of…

We give necessary and sufficient conditions for a real-valued quasiconvex function f on a Baire topological vector space X (in particular, Banach or Frechet space) to be continuous at the points of a residual subset of X. These conditions…

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

Let $C$ be an affine plane curve. We consider additive functions $f: K\rightarrow K$ for which $f(x)f(y)=0$, whenever $(x,y)\in C$. We show that if $K=\mathbb{R}$ and $C$ is the hyperbola with defining equation $xy=1$, then there exist…

For a finite set $A \subseteq \mathbb{R}^n$, consider a function $u \in \mathrm{BV}_{\mathrm{loc}}^2(\mathbb{R}^n)$ such that $\nabla u \in A$ almost everywhere. If $A$ is convex independent, then it follows that $u$ is piecewise affine…

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

We prove that if $f:I\subset \Bbb R\to \Bbb R$ is of bounded variation, then the noncentered maximal function $Mf$ is absolutely continuous, and its derivative satisfies the sharp inequality $\|DMf\|_1\le |Df|(I)$. This allows us obtain,…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

We classify the semifields and division semirings containing the max-plus semifield $\mathbb{Z}_\mathrm{max}$, which are finitely generated as $\mathbb{Z}_\mathrm{max}$-semimodules.

We introduce extremal affine surface areas in a functional setting. We show their main properties. Among them are linear invariance, isoperimetric inequalities and monotonicity properties. We establish a new duality formula, which shows…

We provide a new proof that the subdifferential of a proper lower semicontinuous convex function on a Banach space is maximal monotone by adapting the pattern commonly used in the Hilbert setting. We then extend the arguments to show more…

Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

In a previous paper we introduced the concept of semiseparable functor. Here we continue our study of these functors in connection with idempotent (Cauchy) completion. To this aim, we introduce and investigate the notions of (co)reflection…

Let $D_j\subset\Bbb C^{k_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluripolar set, $j=1,...,N$. Put$$X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N\subset\Bbb…

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…

Composite functions have been studied for over 40 years and appear in a wide range of optimization problems. Convex analysis of these functions focuses on (i) conditions for convexity of the function based on properties of its components,…