منابع مشابه
Deciding Polyhedrality of Spectrahedra
Spectrahedra are linear sections of the cone of positive semidefinite matrices which, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We generalize and strengthen results of [M. V. Ramana, Polyhedra, spectrahedra, and semidefinite programming, in Topics in Semidefinite and Interior-Point Methods, Fi...
متن کاملFacial Reduction and Partial Polyhedrality
We present FRA-Poly, a facial reduction algorithm (FRA) for conic linear programs that is sensitive to the presence of polyhedral faces in the cone. The main goals of FRA and FRA-Poly are the same, i.e., finding the minimal face containing the feasible region and detecting infeasibility, but FRA-Poly treats polyhedral constraints separately. This reduces the number of iterations drastically whe...
متن کاملPolyhedrality in Orlicz Spaces
We present a construction of an Orlicz space admitting a C∞-smooth bump which depends locally on finitely many coordinates, and which is not isomorphic to a subspace of any C(K), K scattered. In view of the related results this space is possibly not isomorphic to a polyhedral space.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملTwo-Dimensional Range Diameter Queries
Given a set of n points in the plane, range diameter queries ask for the furthest pair of points in a given axis-parallel rectangular range. We provide evidence for the hardness of designing space-efficient data structures that support range diameter queries by giving a reduction from the set intersection problem. The difficulty of the latter problem is widely acknowledged and is conjectured to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas
سال: 2017
ISSN: 1578-7303,1579-1505
DOI: 10.1007/s13398-017-0458-8