longest chain of faces

On the longest chain of faces of completely positive and copositive cones

  • Mitsuhiro Nishijima
    • Categories Cone Programming, Linear, Cone and Semidefinite Programming Tags , , , , ,

    We consider a wide class of closed convex cones K in the space of real n*n symmetric matrices and establish the existence of a chain of faces of K, the length of which is maximized at n(n+1)/2 + 1. Examples of such cones include, but are not limited to, the completely positive and the copositive … Read more

    A bound on the Carathéodory number

  • Masaru Ito
  • Bruno F. Lourenço
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming Tags , , ,

    The Carathéodory number k(K) of a pointed closed convex cone K is the minimum among all the k for which every element of K can be written as a nonnegative linear combination of at most k elements belonging to extreme rays. Carathéodory’s Theorem gives the bound k(K) <= dim (K). In this work we observe … Read more