Quadratic image of a ball: Towards efficient description of the boundary

We propose a simple efficient machinery for computing “nearly exact” boundary of the image of euclidean ball under multidimensional quadratic mapping. It is based on necessary conditions for a point to be mapped to the boundary. Several special cases are considered, the results of numerical simulations are presented, in particular, as applied to multiobjective optimization and Pareto set discovery.