In this paper, we propose a smoothing method for minimax problem. The metho
d is based on the exponential penalty function of Kort and Bertsekas for co
nstrained optimization. Under suitable condition, the method is globally co
nvergent. Preliminary numerical experiments indicate the promising of the a
lgorithm.