Given a set ¦[ of Rn and a function f:¦[⇒Rn the problem of finding a point sx∈¦[ such that (x-xs)tf(xs)∈0 for any x∈¦[ is referred to as a stationary point problem and xs is called a stationary point. For the problem with conical ¦[ and strongly copositive f the authors propose a system of equations whose solution set contains a path connecting a trivial starting point to a stationary point. They also develop an algorithm to trace the path when f is an affine function with a copositive plus matrix. Starting with an appropriate point the algorithm provides a stationary point or shows that there exist no stationary points.
