×

zbMATH — the first resource for mathematics

Methods for global concave minimization: A bibliographic survey. (English) Zbl 0602.90105
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.

MSC:
90C25 Convex programming
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
49M37 Numerical methods based on nonlinear programming
90C30 Nonlinear programming
Software:
MINOS
PDF BibTeX XML Cite
Full Text: DOI