Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes

Abstract
An exhaustive and nondegenerate cone splitting process is defined and an algorithm stated for minimizing a quasi-concave function on a bounded convex polytope described by a system of linear inequalities. The algorithm crucially splits upon vertices and it is shown that this class of algorithms converges finitely to an optimal solution.

This publication has 0 references indexed in Scilit: