中文
相关论文

相关论文: Another Proof of the Fact that Polyhedral Cones ar…

200 篇论文

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

泛函分析 · 数学 2011-11-22 Taras Banakh , Ivan Hetman

It is well-known that every polyhedral cone is finitely generated (i.e. polytopal), and vice versa. Surprisingly, the two notions differ almost always for non-commutative versions of such cones. This was obtained as a byproduct in an…

代数几何 · 数学 2019-03-01 Beatrix Huber , Tim Netzer

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

We study the observation congruences induced by rational polyhedral cones on vector-valued quantitative languages. The extreme rays of the dual cone define intrinsic covectors, and these covectors classify every incremental residual future…

形式语言与自动机理论 · 计算机科学 2026-05-29 Faruk Alpay , Baris Basaran

A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…

最优化与控制 · 数学 2018-12-27 Asteroide Santana , Santanu S. Dey

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

最优化与控制 · 数学 2025-10-10 David Avis

The factorial hull of the projective variety X (or its cone) is a graded algebra R(X) that can be used in some situations to consider simultaneously all divisor classes on X. Associated with X is a certain cone H in the divisor class group…

代数几何 · 数学 2007-05-23 Lex E. Renner

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 prove that the existence of a finite Minkowski base for Okounkov bodies on a smooth projective variety with respect to an admissible flag implies rational polyhedrality of the global Okounkov body. As an application of this general…

代数几何 · 数学 2014-03-19 David Schmitz , Henrik Seppänen

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

组合数学 · 数学 2016-11-21 Nima Amini

We show that for every injective continuous map f: S^2 --> R^3 there are four distinct points in the image of f such that the convex hull is a tetrahedron with the property that two opposite edges have the same length and the other four…

代数拓扑 · 数学 2008-08-29 Pavle V. M. Blagojevic , Günter M. Ziegler

Let ${\cal S}_+^n \subset {\cal S}^n$ be the cone of positive semi-definite matrices as a subset of the vector space of real symmetric $n \times n$ matrices. The intersection of ${\cal S}_+^n$ with a linear subspace of ${\cal S}^n$ is…

最优化与控制 · 数学 2015-04-08 Roland Hildebrand

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…

代数几何 · 数学 2024-01-24 José F. Fernando , J. M. Gamboa , Carlos Ueno

In 1959, Klee proved that a convex body $K$ is a polyhedron if and only if all of its projections are polygons. In this paper, a new proof of this theorem is given for convex bodies in $\mathbb{R}^3$.

度量几何 · 数学 2015-03-06 John J. Zanazzi

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

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

复变函数 · 数学 2007-05-23 Marshall A. Whittlesey

Let $X$ be a rational surface obtained by blowing up at a configuration $\mathcal{C}$ of infinitely near points over a Hirzebruch surface $\mathbb{F}_\delta$. We prove that there exist two positive integers $a \leq b$ such that the cone of…

代数几何 · 数学 2025-07-15 Carlos Galindo , Francisco Monserrat , Carlos-Jesús Moreno-Ávila

Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…

最优化与控制 · 数学 2015-07-22 Avinash Bhardwaj , Philipp Rostalski , Raman Sanyal

We show that the pseudoeffective cone of $k$-cycles on a complete complexity one $T$-variety is rational polyhedral for any $k$, generated by classes of $T$-invariant subvarieties. When $X$ is also rational, we give a presentation of the…

代数几何 · 数学 2019-07-26 Bernt Ivar Utstøl Nødland

The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…

最优化与控制 · 数学 2018-10-03 Amitabh Basu , Michele Conforti , Marco Di Summa , Joseph Paat
‹ 上一页 1 2 3 10 下一页 ›