Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On the derivative cones of polyhedral cones

View through CrossRef
Abstract Hyperbolic polynomials elegantly encode a rich class of convex cones that includes polyhedral and spectrahedral cones. Hyperbolic polynomials are closed under taking polars and the corresponding cones-the derivative cones-yield relaxations for the associated optimization problem and exhibit interesting facial properties. While it is unknown if every hyperbolicity cone is a section of the positive semidefinite cone, it is natural to ask whether spectrahedral cones are closed under taking derivative cones. In this note we give an affirmative answer for polyhedral cones by exhibiting an explicit spectrahedral representation for the first derivative cone. We also prove that higher polars do not have a determinantal representation which shows that the problem for general spectrahedral cones is considerably more difficult
Walter de Gruyter GmbH
Title: On the derivative cones of polyhedral cones
Description:
Abstract Hyperbolic polynomials elegantly encode a rich class of convex cones that includes polyhedral and spectrahedral cones.
Hyperbolic polynomials are closed under taking polars and the corresponding cones-the derivative cones-yield relaxations for the associated optimization problem and exhibit interesting facial properties.
While it is unknown if every hyperbolicity cone is a section of the positive semidefinite cone, it is natural to ask whether spectrahedral cones are closed under taking derivative cones.
In this note we give an affirmative answer for polyhedral cones by exhibiting an explicit spectrahedral representation for the first derivative cone.
We also prove that higher polars do not have a determinantal representation which shows that the problem for general spectrahedral cones is considerably more difficult.

Related Results

Solving polyhedral d.c. optimization problems via concave minimization
Solving polyhedral d.c. optimization problems via concave minimization
AbstractThe problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral...
Image of the World on polyhedral maps and globes
Image of the World on polyhedral maps and globes
AbstractApplication of polyhedrons as image surface in cartographic projections has a tradition of more than 200 years. The first maps relying on polyhedrons appeared in the 19th c...
Canonical Analysis of two Convex Polyhedral Cones and Applications
Canonical Analysis of two Convex Polyhedral Cones and Applications
Canonical analysis of two convex polyhedral cones consists in looking for two vectors (one in each cone) whose square cosine is a maximum. This paper presents new results about the...
Imaging the structural organization of chemical elements in growth cones of developing hippocampal neurons
Imaging the structural organization of chemical elements in growth cones of developing hippocampal neurons
AbstractDuring neurodevelopment, neurons form growth cones, F-actin rich extensions located at the distal end of the neurites. Growth cones allow dendrites and axons to build synap...
Application of Polyhedral Mesh for Vortex Formation Study for Simple Single Pump Sump
Application of Polyhedral Mesh for Vortex Formation Study for Simple Single Pump Sump
Meshing of domain in CFD is an important step to ensure accuracy of the solution. In the past, hexahedral or tetrahedral mesh systems were commonly used, and both have their merits...
Hyperbolicity cones are amenable
Hyperbolicity cones are amenable
AbstractAmenability is a notion of facial exposedness for convex cones that is stronger than being facially dual complete (or ‘nice’) which is, in turn, stronger than merely being ...

Back to Top