The Complexity of Simple Models-A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem

In a Standard Quadratic Optimization Problem (StQP), a possibly indefinite quadratic form (the simplest nonlinear function) is extremized over the standard simplex, the simplest polytope. Despite this simplicity, the nonconvex instances of this problem class allow for remarkably rich patterns of coexisting local solutions, which is closely related to practical difficulties in solving StQPs globally. In this study, we improve on existing lower bounds for the number of strict local solutions by a new technique to construct instances with a rich solution structure. Furthermore, we provide extensive case studies where the system of supports (the so-called pattern) of solutions are analyzed in detail. Note that by naive simulation, in accordance to theory, most of the interesting patterns would not be encountered, since random instances have, with a high probability, quite sparse solutions (with singleton or doubleton supports), and likewise their expected numbers are considerably lower than in the worst case. Hence, instances with a rich solution pattern are rather rare. On the other hand, by concentrating on (thin) subsets of promising instances, we are able to give an empirical answer on the size distribution of supports of strict local solutions to the StQP and their patterns, complementing average-case analysis of this NP-hard problem class.