Quadratic programs with hollows

Let F be a quadratically constrained, possibly nonconvex, bounded set, and let E 1 , … , E l denote ellipsoids contained in F with non-intersecting interiors. We prove that minimizing an arbitrary quadratic q ( · ) over G : = F \ ∪ k = 1 ℓ int ( E k ) is no more difficult than minimizing q ( · ) ove...

Full description