Key points are not available for this paper at this time.
We propose an algorithm to locate a global maximum of an increasing function subject to an increasing constraint on the cone of vectors with nonnegative coordinates. The algorithm is based on the outer approximation of the feasible set. We eastablish the con vergence of the algorithm and provide a number of numerical experiments. We also discuss the types of constraints and objective functions for which the algorithm is best suited
Rubinov et al. (Mon,) studied this question.