“…This smoothing approach has been also proposed by Polak-Royset-Womersley [20], by Sheu-Wu [27] for finite min-max problems subject to infinitely many linear constraints and, more recently, by Sheu-Lin [26] for continuous min-max problems, motivated by the global approach of Fang-Wu [12] using an integral analog. We must also smooth the function δ D k and to do that we consider the smoothing approach by penalty and barrier functions introduced, for ordinary convex programs, by Auslender-Cominetti-Haddou [3]. These authors exploited the notion of recession functions to provide a wide class of penalty and barrier methods for usual convex programs, with a finite number of inequalities.…”