A Unifying Approach to Solve a Class of Parametrically-Convexifiable Problems

The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, in a unifying framework, by means of the so-called optimal level solutions method. In other words, the problems are solved by analyz- ing, explicitly or implicitly, the optimal solutions of particular quadratic strictly convex parametric subproblems. In particular, it is pointed out that some of these problems share the same set of optimal level solutions. A solution algorithm is pro- posed and fully described. The results achieved are then deepened in the particular case of box constrained problems