Smoothing Method for Minimax Problems

In this paper, we propose a smoothing method for minimax problem. The method is based on the exponential penalty function of Kort and Bertsekas for constrained optimization. Under suitable condition, the method is globally convergent. Preliminary numerical experiments indicate the promising of the algorithm.

[1]  Dimitri P. Bertsekas,et al.  A new algorithm for solution of resistive networks involving diodes , 1976 .

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

[3]  D. Bertsekas.  Approximation procedures based on the method of multipliers , 1977 .

[4]  P. Pardalos,et al.  Minimax and applications , 1995 .

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  James V. Burke,et al.  The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems , 1998, Math. Oper. Res..

[7]  R. Tyrrell Rockafellar,et al.  Computational schemes for large-scale problems in extended linear-quadratic programming , 1990, Math. Program..

[8]  J. Asaadi,et al.  A computational comparison of some non-linear programs , 1973, Math. Program..

[9]  G. Alistair Watson,et al.  An Algorithm for Minimax Approximation in the Nonlinear Case , 1969, Comput. J..

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

[11]  Bintong Chen,et al.  A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions , 1999, SIAM J. Optim..

[12]  C. Charalambous,et al.  Nonlinear programming using minimax techniques , 1974 .

[13]  Keisuke Hotta,et al.  Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems , 1999, Math. Program..

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

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

[16]  P. Tseng.  Analysis Of A Non-Interior Continuation Method Based On Chen-Mangasarian Smoothing Functions For Com , 1998 .

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

[18]  Defeng Sun,et al.  A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities , 2000, Math. Program..

[19]  Stephen E. Sussman-Fort,et al.  Approximate direct-search minimax circuit optimization , 1989 .

[20]  Liqun Qi,et al.  Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..

[21]  R. Rockafellar.  Linear-quadratic programming and optimal control , 1987 .

[22]  Masao Fukushima,et al.  A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints , 1998, Comput. Optim. Appl..

[23]  Song Xu,et al.  A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem , 2000, Math. Program..

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

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

[26]  Xing-Si Li,et al.  AN AGGREGATE FUNCTION METHOD FOR NONLINEAR PROGRAMMING , 1991 .

[27]  Francisco Facchinei,et al.  A smoothing method for mathematical programs with equilibrium constraints , 1999, Math. Program..

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

[29]  Leon S. Lasdon,et al.  Optimization in engineering design , 1967 .

[30]  Ji-Ming Peng,et al.  A non-interior continuation method for generalized linear complementarity problems , 1999, Math. Program..