Finding the Global Minimum of the General Quadratic Problems During Deterministic Global Optimization in Cyber-Physical Systems
Cyber-Physical Systems (CPS) are integrations of computation and physical processes. We consider effective computations for designing difficult systems. In this paper, we propose new method of exact quadratic regularization for deterministic global optimization (EQR). This method can be used for the solution of a wide class of multiextreme problems, in particular, general quadratic problems. These problems will be transformed to maximization of norm a vector on convex set. The convex set is approximated by a polyhedron or intersection of balls.