Algorithms with Adaptive Smoothing for Finite Minimax Problems

We present a new feedback precision-adjustment rule for use with a smoothing technique and standard unconstrained minimization algorithms in the solution of finite minimax problems. Initially, the feedback rule keeps a precision parameter low, but allows it to grow as the number of iterations of the resulting algorithm goes to infinity. Consequently, the ill-conditioning usually associated with large precision parameters is considerably reduced, resulting in more efficient solution of finite minimax problems.The resulting algorithms are very simple to implement, and therefore are particularly suitable for use in situations where one cannot justify the investment of time needed to retrieve a specialized minimax code, install it on one's platform, learn how to use it, and convert data from other formats. Our numerical tests show that the algorithms are robust and quite effective, and that their performance is comparable to or better than that of other algorithms available in the Matlab environment.

[1]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[2]  André L. Tits,et al.  Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions , 1998, SIAM J. Optim..

[3]  David Q. Mayne,et al.  A barrier function method for minimax problems , 1992, Math. Program..

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

[5]  E. Polak,et al.  An ε-active barrier-function method for solving minimax problems , 1991 .

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

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

[8]  Luigi Grippo,et al.  A smooth method for the finite minimax problem , 1993, Math. Program..

[9]  W. Murray,et al.  A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization , 1980 .

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

[11]  Song Xu,et al.  Smoothing Method for Minimax Problems , 2001, Comput. Optim. Appl..

[12]  R. Fletcher,et al.  An algorithm for composite nonsmooth optimization problems , 1986 .

[13]  E. Polak.  On the mathematical foundations of nondifferentiable optimization in engineering design , 1987 .

[14]  Kaj Madsen,et al.  Linearly constrained minimax optimization , 1978, Math. Program..

[15]  David Q. Mayne,et al.  On the extension of Newton's method to semi-infinite minimax problems , 1992 .

[16]  D. Mayne,et al.  Nondifferential optimization via adaptive smoothing , 1984 .

[17]  A. Vardi,et al.  New minimax algorithm , 1984 .

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

[19]  Robert S. Womersley.  A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere , 2000 .

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

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

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

[23]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[24]  On the Numerical Solution of Parabolic Equations in a Single Space Variable by the Continuous Time Galerkin Method , 1980 .

[25]  C. Charalambous,et al.  Non-linear minimax optimization as a sequence of least pth optimization with finite values of p , 1976 .

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

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

[28]  Harald Günzel,et al.  On Logarithmic Smoothing of the Maximum Function , 2001, Ann. Oper. Res..

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

[30]  Elijah Polak,et al.  On the rate of convergence of certain methods of centers , 1972, Math. Program..

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

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

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

[34]  Li Xingsi,et al.  AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATION , 1992 .

[35]  Andrew R. Conn,et al.  A Structure-Exploiting Algorithm for Nonlinear Minimax Problems , 1992, SIAM J. Optim..

[36]  Ian H. Sloan,et al.  How good can polynomial interpolation on the sphere be? , 2001, Adv. Comput. Math..

[37]  Konrad Oettershagen.  Ein superlinear konvergenter Algorithmus zur Lösung semi-infiniter Optimierungsprobleme , 1982 .

[38]  D. Mayne,et al.  Adaptive control of ARMA plants using worst-case design by semi-infinite optimization , 1987 .

[39]  A. Tits,et al.  Nonmonotone line search for minimax problems , 1993 .

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

[41]  V. N. Malozemov,et al.  ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS , 1971 .

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