Stefan Bundfuss

Learn More
We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer approximations of the copositive cone which we show to be(More)
We consider an Axiom A diffeomorphism or a Markov map of an interval and the invariant set Ω∗ of orbits which never falls into a fixed hole. We study various aspects of the symbolic representation of Ω∗ and of its nonwandering set Ω. Our results are on the cardinality of the set of topologically transitive components of Ω and their structure. We also prove(More)
  • 1