中文
相关论文

相关论文: Semidefinite approximations of conical hulls of me…

200 篇论文

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

最优化与控制 · 数学 2023-05-04 Daniel Dörfler

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

最优化与控制 · 数学 2016-11-17 James Saunderson , Pablo A. Parrilo

Given a Borel measure $\mu$ on ${\mathbb R}^{n}$, we define a convex set by \[ M({\mu})=\bigcup_{\substack{0\le f\le1,\\ \int_{{\mathbb R}^{n}}f\,{\rm d}{\mu}=1 } }\left\{ \int_{{\mathbb R}^{n}}yf\left(y\right)\,{\rm…

度量几何 · 数学 2017-06-23 Han Huang , Boaz A. Slomka

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

计算几何 · 计算机科学 2014-04-25 Quentin Mérigot

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

代数几何 · 数学 2024-10-15 Claus Scheiderer

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

表示论 · 数学 2024-02-22 Valdemar V. Tsanov

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

最优化与控制 · 数学 2022-09-08 Dogyoon Song , Pablo A. Parrilo

Let V be a semialgebraic set parameterized by quadratic polynomials over a quadratic set T. This paper studies semidefinite representation of its convex hull by projections of spectrahedra (defined by linear matrix inequalities). When T is…

最优化与控制 · 数学 2011-10-13 Jiawang Nie

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

代数几何 · 数学 2017-09-19 Claus Scheiderer

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

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 consider an appoximation of a catenoid constructed from "odd" truncated cones that maintains minimality in a certain sense. Thorough this procedure, we obtain a discrete curve approximating a catenary by exploiting the fact that it is…

微分几何 · 数学 2012-07-26 Akihito Ebisu , Yoshiroh Machigashira

We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…

最优化与控制 · 数学 2026-04-16 Thomas Lew , Riccardo Bonalli , Marco Pavone

This article is concerned with the problem of approximating a not necessarily bounded spectrahedral shadow, a certain convex set, by polyhedra. By identifying the set with its homogenization the problem is reduced to the approximation of a…

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

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

最优化与控制 · 数学 2008-09-22 Didier Henrion

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

最优化与控制 · 数学 2022-06-14 Hamza Fawzi

We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e.…

最优化与控制 · 数学 2015-07-17 James Saunderson , Pablo A. Parrilo , Alan S. Willsky

We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…

复变函数 · 数学 2025-08-05 Álfheiður Edda Sigurðardóttir

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…

最优化与控制 · 数学 2014-02-25 Feng Guo , Chu Wang , Lihong Zhi

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

泛函分析 · 数学 2010-10-13 Maxim V. Balashov , Dušan Repovš
‹ 上一页 1 2 3 10 下一页 ›