Key points are not available for this paper at this time.
The global concave minimization problem is to find the constrained global minimum of a concave function. Since such a function may have many local minima, finding the global minimum is a computationally difficult problem. In this bibliographic survey, which includes most of the recent papers on constrained global concave minimization, we have attempted to briefly summarize the main ideas in each paper. These recent papers include those concerned with large scale global concave minimization and bilinear programming.
Pardalos et al. (Mon,) studied this question.