A hybrid algorithm for nonlinear minimax problems

In this paper, a hybrid algorithm for solving finite minimax problem is presented. In the algorithm, we combine the trust-region methods with the line-search methods and curve-search methods. By means of this hybrid technique, the algorithm, according to the specific situation at each iteration, can adaptively performs the trust-region step, line-search step or curve-search step, so as to avoid possibly solving the trust-region subproblems many times, and make better use of the advantages of different methods. Moreover, we use second-order correction step to circumvent the difficulties of the Maratos effect occurred in the nonsmooth optimization. Under mild conditions, we prove that the new algorithm is of global convergence and locally superlinear convergence. The preliminary experiments show that the new algorithm performs efficiently.

[1]  G. Watson.  The Minimax Solution of an Overdetermined System of Non-linear Equations , 1979 .

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

[3]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[4]  Ya-Xiang Yuan.  Advances in Nonlinear Programming , 1998 .

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

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

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

[8]  Ran Quan,et al.  A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems , 2007 .

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

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

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

[12]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

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

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

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

[16]  Peiping Shen,et al.  A new pruning test for finding all global minimizers of nonsmooth functions , 2005, Appl. Math. Comput..

[17]  William W. Hager,et al.  Stabilized Sequential Quadratic Programming , 1999, Comput. Optim. Appl..

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

[19]  Wenyu Sun,et al.  Nonmonotone trust region method for solving optimization problems , 2004, Appl. Math. Comput..

[20]  J. Jian.  New Sequential Quadratically-Constrained Quadratic Programming Method of Feasible Directions and Its Convergence Rate , 2006 .

[21]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

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

[23]  Jorge Nocedal,et al.  Combining Trust Region and Line Search Techniques , 1998 .

[24]  M. Overton.  Algorithms for nonlinear L1 and L∞ fitting , 1982 .

[25]  Ladislav Luksan,et al.  A compact variable metric algorithm for nonlinear minimax approximation , 1986, Computing.

[26]  Shu-Cherng Fang,et al.  On the entropic regularization method for solving min-max problems with applications , 1997, Math. Methods Oper. Res..

[27]  Fusheng Wang,et al.  A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization , 2006, Appl. Math. Comput..

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

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

[30]  M. J. D. Powell,et al.  Nonlinear optimization, 1981 , 1982 .

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

[32]  M. J. D. Powell,et al.  On the global convergence of trust region algorithms for unconstrained minimization , 1984, Math. Program..

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

[34]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[35]  Ya-Xiang Yuan,et al.  On the convergence of a new trust region algorithm , 1995 .

[36]  E. Michael Gertz,et al.  A quasi-Newton trust-region method , 2004, Math. Program..

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