When we apply an interior point method to concave minimization problems, it is desirable to start from a good initial point. We introduce a extended objective function to obtain such a good initial point. A generated sequence of points starting from this good initial point converges to an optimum solution in special cases. Although not in such cases, cutting plane methods works effectively to obtain a global optimum solution. We present an idea of an algorithm in this paper.
展开▼
