This paper presents an iterative method for some class of minimax problems, namely "Minimize max_kf_k(x)", based on the fact that max_kf_k(x)is, with p large enough, approximated by (Σ_kf_k(x)^p)^<1/p>which is a smooth function, and hence can be minimized by means of Newton's iteration ; and also dicusses its applications to problems in computational geometry.
