中文
相关论文

相关论文: An introduction to matrix convex sets and free spe…

200 篇论文

We initiate the study of matrix convexity for operator spaces. We define the notion of compact rectangular matrix convex set, and prove the natural analogs of the Krein-Milman and the bipolar theorems in this context. We deduce a canonical…

算子代数 · 数学 2020-09-23 Adam H. Fuller , Michael Hartz , Martino Lupini

L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…

组合数学 · 数学 2022-03-28 Satoko Moriguchi , Kazuo Murota

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…

最优化与控制 · 数学 2024-01-25 Daniel Dörfler , Andreas Löhne

In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…

代数几何 · 数学 2017-08-10 Công-Trình Lê , Thi-Hoa-Binh Du

This is a survey about spectral sets, to appear in the second edition of Handbook of Linear Algebra (L. Hogben, ed.). Spectral sets and K-spectral sets, introduced by John von Neumann, offer a possibility to estimate the norm of functions…

泛函分析 · 数学 2017-06-06 Catalin Badea , Bernhard Beckermann

This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…

算子代数 · 数学 2022-02-24 Eric Evert

Motivated by the Hofmann--Lawson theorem, which states that every continuous lattice is inf-generated by its irreducible elements, we explore how to represent posets by extreme points with respect to a closure operator. For this purpose, we…

组合数学 · 数学 2025-09-09 Paul Poncet

For Hilbert spaces $\mathcal H\subseteq L^2(\mathbb R)$ we consider the convex sets $\mathcal D_+(\mathcal H)$ of Wigner-positive states (WPS), i.e.~density matrices over $\mathcal H$ with non-negative Wigner function. We investigate the…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

泛函分析 · 数学 2010-06-02 Gordan Zitkovic

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

最优化与控制 · 数学 2018-06-18 Evgeni Nurminski , Stan Uryasev

This work is concerned with different aspects of spectrahedra and their projections, sets that are important in semidefinite optimization. We prove results on the limitations of so called Lasserre and theta body relaxation methods for…

最优化与控制 · 数学 2010-05-28 João Gouveia , Tim Netzer

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

组合数学 · 数学 2024-02-14 Balázs Keszegh

We introduce complex cones and associated projective gauges, generalizing a real Birkhoff cone and its Hilbert metric to complex vector spaces. We deduce a variety of spectral gap theorems in complex Banach spaces. We prove a dominated…

动力系统 · 数学 2011-02-22 Hans Henrik Rugh

Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…

泛函分析 · 数学 2016-12-23 Roman Vershynin

Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a…

泛函分析 · 数学 2021-06-03 Michael Jury , Igor Klep , Mark E. Mancuso , Scott McCullough , James Eldred Pascoe

A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of…

最优化与控制 · 数学 2009-08-25 Tim Netzer , Rainer Sinn

We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…

最优化与控制 · 数学 2017-01-24 Amitabh Basu , Michele Conforti , Gerard Cornuejols , Giacomo Zambelli

A number of landmark existence theorems of nonlinear functional analysis follow in a simple and direct way from the basic separation of convex closed sets in finite dimension via elementary versions of the Knaster-Kuratowski-Mazurkiewicz…

泛函分析 · 数学 2015-01-26 Hichem Ben-El-Mechaiekh

In this paper, we generalize Minkowski's theorem. This theorem is usually stated for a centrally symmetric convex body and a lattice both included in $\mathbb{R}^n$. In some situations, one may replace the lattice by a more general set for…

度量几何 · 数学 2016-04-15 Pierre-Antoine Guihéneuf , Emilien Joly

The aim of this paper is twofold. On one hand the generalized Minkowski sets are defined and characterized. On the other hand, the Motzkin decomposable sets, along with their epigraphic versions are considered and characterized in new ways.…

最优化与控制 · 数学 2023-01-24 Juan Enrique Martínez-Legaz , Cornel Pintea