A smooth method for the finite minimax problem

We consider unconstrained minimax problems where the objective function is the maximum of a finite number of smooth functions. We prove that, under usual assumptions, it is possible to construct a continuously differentiable function, whose minimizers yield the minimizers of the max function and the corresponding minimum values. On this basis, we can define implementable algorithms for the solution of the minimax problem, which are globally convergent at a superlinear convergence rate. Preliminary numerical results are reported.

[1]  M. Hestenes.  Optimization Theory: The Finite Dimensional Case , 1975 .

[2]  Robert Mifflin,et al.  An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[3]  E. Polak.  Basics of Minimax Algorithms , 1989 .

[4]  Stefano Lucidi,et al.  New Results on a Continuously Differentiable Exact Penalty Function , 1992, SIAM J. Optim..

[5]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[6]  M. Vidyasagar,et al.  An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation , 1979 .

[7]  L. Grippo,et al.  A class of nonmonotone stabilization methods in unconstrained optimization , 1991 .

[8]  Kaj Madsen,et al.  Combined lp and quasi-Newton methods for minimax optimization , 1981, Math. Program..

[9]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[10]  R. Polyak.  Smooth optimization methods for minimax problems , 1988 .

[11]  Torkel Glad,et al.  A multiplier method with automatic limitation of penalty growth , 1979, Math. Program..

[12]  R. Fletcher,et al.  Second order corrections for non-differentiable optimization , 1982 .

[13]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[14]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[15]  S. P. Han,et al.  Variable metric methods for minimizing a class of nondifferentiable functions , 1977, Math. Program..

[16]  D. Bertsekas.  Nondifferentiable optimization via approximation , 1975 .

[17]  L. Grippo,et al.  An exact penalty function method with global convergence properties for nonlinear programming problems , 1986, Math. Program..

[18]  John W. Bandler,et al.  Practical Least pth Optimization of Networks , 1972 .

[19]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[20]  Ya-Xiang Yuan,et al.  On the superlinear convergence of a trust region algorithm for nonsmooth optimization , 1985, Math. Program..

[21]  R. Fletcher.  A model algorithm for composite nondifferentiable optimization problems , 1982 .

[22]  Manlio Gaudioso,et al.  A bundle type approach to the unconstrained minimization of convex nonsmooth functions , 1982, Math. Program..

[23]  V. F. Dem'yanov,et al.  Nondifferentiable Optimization , 1985 .

[24]  Christakis Charalambous,et al.  Acceleration of the leastpth algorithm for minimax optimization with engineering applications , 1979, Math. Program..

[25]  Susana Gómez,et al.  A regularization method for solving the finite convex min-max problem , 1990 .

[26]  A. Conn,et al.  An Efficient Method to Solve the Minimax Problem Directly , 1978 .

[27]  B. N. Pshenichnyi,et al.  Numerical Methods in Extremal Problems. , 1978 .

[28]  D. Mayne,et al.  Superlinearly convergent algorithm for min-max problems , 1991 .

[29]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[30]  Israel Zang,et al.  A smoothing-out technique for min—max optimization , 1980, Math. Program..

[31]  V. F. Demʹi︠a︡nov,et al.  Nonsmooth optimization and related topics , 1989 .

[32]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .