  The aim of this paper is to present an original approach that takes advantage
from the geometric features of strictly convex functions to tackle the problem
of finding the minimum from another perspective. The general idea is that near
the point of minimum, the function is 'v-shaped' and so we can reduce the
interval where the minimum lies by finding the intersection between the
function and a proper horizontal line whose levels decrease step by step. This
idea, under some appropriate assumptions, led us to formalise an algorithm that
is able to determine the minimum point sought. Furthermore, we see that this
approach can be generalized to a wider class of functions. In the last part of
this paper we provide the construction of an anomalous function for which the
algorithm cannot be used.
