An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions

A common strategy for achieving global convergence in the solution of semi-innnite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively ner discretization meshes. Finely discretized minimax and SIP problems, as well as other problems with many more objec-tives/constraints than variables, call for algorithms in which successive search directions are computed based on a small but signiicant subset of the objectives/constraints, with ensuing reduced computing cost per iteration and decreased risk of numerical diiculties. In this paper, an SQP-type algorithm is proposed that incorporates this idea in the particular case of minimax problems. The general case will be considered in a separate paper. The quadratic programming subproblem that yields the search direction involves only a small subset of the objective functions. This subset is updated at each iteration in such a way that global convergence is insured. Heuristics are suggested that take advantage of a possible close relationship between \adjacent" objective functions. Numerical results demonstrate the eeciency of the proposed algorithm.

[1]  S. Vajda,et al.  Numerical Methods for Non-Linear Optimization , 1973 .

[2]  Carlos A. Mota Soares,et al.  Computer Aided Optimal Design: Structural and Mechanical Systems , 1987, NATO ASI Series.

[3]  E. Polak,et al.  A recursive quadratic programming algorithm for semi-infinite optimization problems , 1982 .

[4]  A. L. Tits,et al.  User's Guide for FSQP Version 3.0c: A FORTRAN Code for Solving Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality and Linear Constraints , 1992 .

[5]  K. Schittkowski.  Solving nonlinear programming problems with very many constraints , 1992 .

[6]  Elijah Polak,et al.  Rate preserving discretization strategies for semi-infinite programming and optimal control , 1990, 29th IEEE Conference on Decision and Control.

[7]  Elijah Polak,et al.  Computational methods in optimization , 1971 .

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

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

[10]  E. Polak,et al.  Control system design via semi-infinite optimization: A review , 1984, Proceedings of the IEEE.

[11]  C. C. Gonzaga,et al.  An improved algorithm for optimization problems with functional inequality constraints , 1980 .

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

[13]  Rainer Hettich,et al.  An implementation of a discretization method for semi-infinite programming , 1986, Math. Program..

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

[15]  Philip E. Gill,et al.  User's guide for QPSOL (Version 3. 2): a Fortran package for quadratic programming , 1984 .

[16]  R. Hettich,et al.  On quadratically convergent methods for semi-infinite programming , 1979 .

[17]  A. Tits,et al.  A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design , 1989 .

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

[19]  Ekkehard W. Sachs,et al.  Local Convergence of SQP Methods in Semi-Infinite Programming , 1995, SIAM J. Optim..

[20]  Masao Fukushima,et al.  On the use of ε-most-active constraints in an exact penalty function method for nonlinear optimization , 1984 .

[21]  R. Reemtsen,et al.  Discretization methods for the solution of semi-infinite programming problems , 1991 .

[22]  A.L. Sangiovanni-Vincentelli,et al.  A survey of optimization techniques for integrated-circuit design , 1981, Proceedings of the IEEE.

[23]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[24]  Bahram Ravani.  Optimal design and mechanical systems analysis , 1990 .

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

[26]  G. Watson.  Globally convergent methods for semi-infinite programming , 1981 .

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

[28]  D. Mayne,et al.  An algorithm for optimization problems with functional inequality constraints , 1976 .

[29]  C. C. Gonzaga,et al.  On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[30]  R. Hettich,et al.  Approximation und Optimierung , 1982 .

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

[32]  W. van Honstede.  An approximation method for semi-infinite problems , 1979 .

[33]  Claus Mattheck,et al.  Engineering Optimization in Design Processes , 1991 .

[34]  G. Zoutendijk,et al.  Methods of Feasible Directions , 1962, The Mathematical Gazette.

[35]  Stephen P. Boyd,et al.  Linear controller design: limits of performance , 1991 .

[36]  Jian L. Zhou.  Fast, Globally Convergent Optimization Algorithms, with Application to Engineering System Design , 1992 .

[37]  Layne T. Watson,et al.  Multi-Objective Control-Structure Optimization via Homotopy Methods , 1993, SIAM J. Optim..

[38]  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..

[39]  M. J. D. Powell,et al.  A tolerant algorithm for linearly constrained optimization calculations , 1989, Math. Program..

[40]  G. Alistair Watson,et al.  A projected lagrangian algorithm for semi-infinite programming , 1985, Math. Program..