2025/09/28 by Oertel, Alexander, Schürmann, Achill
#11H50 (Primary) 11Y16 #15A23 #90C20 (Secondary) #FOS: Mathematics #Metric Geometry (math.MG) #Number Theory (math.NT) #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.2509.23696
Computing the copositive minimum of a strictly copositive quadratic form is a natural generalization of computing the arithmetical minimum of a positive definite one. In this paper we show that this generalized problem is NP-complete. Moreover, we describe a practical method to calculate all shortest vectors using the LDLT-decomposition in a big class of special cases. Our numerical tests show that our method performs significantly better than previous approaches.