Concave minimization via conical partitions and polyhedral outer approximation (Q811411)

The paper deals with a so-called concave minimization problem, i.e. with minimizing a concave function over a convex compact set in \(R^ n\). An algorithm is introduced, which combines branch-and-bound elements with cutting planes. A convergence theorem is proved. Preliminary computer implementations and performance comparisons with earlier methods are reported.