Nonmonotone line search for minimax problems

It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos effect can be prevented by means of a certain nonmonotone (more precisely, three-step or four-step monotone) line search. Using a well-known transformation, this scheme can be readily extended to the case of minimax problems. It turns out however that, due to the structure of these problems, one can use a simpler scheme. Such a scheme is proposed and analyzed in this paper. Numerical experiments indicate a significant advantage of the proposed line search over the Armijo search.

[1]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

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

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

[4]  M. J. D. Powell,et al.  THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[5]  Shih-Ping Han.  Superlinear Convergence of a Minimax Method , 1978 .

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

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

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

[9]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[10]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[11]  D. Mayne,et al.  A surperlinearly convergent algorithm for constrained optimization problems , 1982 .

[12]  C. Lemaréchal,et al.  The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .

[13]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[14]  E. Panier,et al.  A Superlinearly Convergent Method of Feasible Directions for Optimization Problems Arising in the Design of Engineering Systems , 1986 .

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

[16]  A. Ruberti,et al.  Recent advances in communication and control theory , 1987 .

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

[18]  David Q. Mayne,et al.  A superlinearly convergent algorithm for min-max problems , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[19]  An Efficient Algorithm for Nonlinear Minimax Problems , 1990 .

[20]  A. Tits,et al.  User's Guide for FSQP Version 2.0 A Fortran Code for Solving Optimization Problems, Possibly Minimax, with General Inequality Constraints and Linear Equality Constraints, Generating Feasible Iterates , 1990 .

[21]  A. Tits,et al.  Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

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

[23]  J. F. Bonnans,et al.  Avoiding the Maratos effect by means of a nonmonotone line search II. Inequality constrained problems—feasible iterates , 1992 .