, Volume 56, Issue 1, pp 201-211
Date: 18 Nov 2012

An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we present a central cutting plane algorithm for solving convex min-max semi-infinite programming problems. Because the objective function here is non-differentiable, we apply a smoothing technique to the considered problem and develop an algorithm based on the entropy function. It is shown that the global convergence of the proposed algorithm can be obtained under weaker conditions. Some numerical results are presented to show the potential of the proposed algorithm.