中文
相关论文

相关论文: The Minkowski Theorem for Max-plus Convex Sets

200 篇论文

Many real-world applications require the joint optimization of a large number of flexible devices over time. The flexibility of, e.g., multiple batteries, thermostatically controlled loads, or electric vehicles can be used to support grid…

最优化与控制 · 数学 2024-02-29 Emrah Öztürk , Timm Faulwasser , Karl Worthmann , Markus Preißinger , Klaus Rheinberger

Assume that $k \le d$ is a positive integer and $\C$ is a finite collection of convex bodies in $\R^d$. We prove a Helly type theorem: If for every subfamily $\C^*\subset \C$ of size at most $\max \{d+1,2(d-k+1)\}$ the set $\bigcap \C^*$…

度量几何 · 数学 2023-08-22 Imre Barany

We propose to derive deviation measures through the Minkowski gauge of a given set of acceptable positions. We show that, given a suitable acceptance set, any positive homogeneous deviation measure can be accommodated in our framework. In…

风险管理 · 定量金融 2021-07-27 Marlon Moresco , Marcelo Righi , Eduardo Horta

By using a quantum probabilistic approach we obtain a description of the extreme points of the convex set of all joint probability distributions on the product of two standard Borel spaces with fixed marginal distributions.

概率论 · 数学 2007-05-23 K. R. Parthasarathy

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

度量几何 · 数学 2025-02-20 Florian Grundbacher

We discuss some key results from convex analysis in the setting of topological groups and monoids. These include separation theorems, Krein-Milman type theorems, and minimax theorems.

最优化与控制 · 数学 2015-10-16 Jonathan M. Borwein , Ohad Giladi

Here is one of the results obtained in this paper: Let $X, Y$ be two convex sets each in a real vector space, let $J:X\times Y\to {\bf R}$ be convex and without global minima in $X$ and concave in $Y$, and let $\Phi:X\to {\bf R}$ be…

最优化与控制 · 数学 2019-09-19 Biagio Ricceri

In the literature, the Minkowski-sum and the metric-sum of compact sets are highlighted. While the first is associative, the latter is not. But the major drawback of the Minkowski combination is that, by increasing the number of summands,…

动力系统 · 数学 2025-04-16 Ekta Agrawal , Saurabh Verma

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…

组合数学 · 数学 2023-04-05 Niklas Kochdumper , Matthias Althoff

We state and prove a new closure theorem closely related to the classical closure theorems of Poncelet and Steiner. Along the way, we establish a number of theorems concerning conic sections.

度量几何 · 数学 2013-10-15 Nikolai Beluhov

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

综合数学 · 数学 2007-05-23 Iosif Pinelis

We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a…

度量几何 · 数学 2023-09-14 Evan DeCorte , Fernando Mário de Oliveira Filho , Frank Vallentin

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

微分几何 · 数学 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

In this short note we explain why the log-Brunn-Minkowski conjecture is correct for complex convex bodies. We do this by relating the conjecture to the notion of complex interpolation, and appealing to a general theorem by…

度量几何 · 数学 2014-12-18 Liran Rotem

Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…

最优化与控制 · 数学 2016-08-11 Petra Weidner

We consider the family of constant width bodies in $\mathbb{R}^3$ which is convex under Minkowski addition. Extreme shapes cannot be expressed as a nontrivial convex combination of other constant width bodies. We show that each Meissner…

度量几何 · 数学 2025-01-29 Ryan Hynd

The Minkowski product of unit quaternion sets is introduced and analyzed, motivated by the desire to characterize the overall variation of compounded spatial rotations that result from individual rotations subject to known uncertainties in…

复变函数 · 数学 2019-05-29 Rida T. Farouki , Graziano Gentili , Hwan Pyo Moon , Caterina Stoppato

We give an alternative proof of a result on the uniform overlap of the algebraic sums of the sets arising from a decomposition of a neighborhood of a circular cone in $\Bbb R^3$. It is known that the uniform overlap result can be applied to…

经典分析与常微分方程 · 数学 2023-12-27 Shuichi Sato

It is shown that max-stable random vectors in $[0,\infty)^d$ with unit Fr\'echet marginals are in one to one correspondence with convex sets $K$ in $[0,\infty)^d$ called max-zonoids. The max-zonoids can be characterised as sets obtained as…

概率论 · 数学 2007-10-29 Ilya Molchanov

We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-max theorem of Abeledo and Atkinson on the Clar number of…

组合数学 · 数学 2012-05-29 Dóra Erdős , András Frank , Krisztián Kun