Before revision:  We show that with the property of NEPv , any algorithm finding the positive stationary point of this optimization problem actually finds its global minimum, such as the regularized Newton (RN) method.
After revision:  We show that with the property of NEPv , any algorithm converging to the nonnegative stationary point of this optimization problem actually finds its global minimum, such as the regularized Newton (RN) method.