Constrained, non-linear, derivative-free, parallel optimization of continuous, high computing load, noisy objective functions

The main result is a new original algorithm: CONDOR ("COnstrained, Non-linear, Direct, parallel Optimization using trust Region method for high-computing load, noisy functions"). The aim of this algorithm is to find the minimum x* of an objective function F(x) (x is a vector whose dimension is between 1 and 150) using the least number of function evaluations of F(x). It is assumed that the dominant computing cost of the optimization process is the time needed to evaluate the objective function F(x) (One evaluation can range from 2 minutes to 2 days). The algorithm will try to minimize the number of evaluations of F(x), at the cost of a huge amount of routine work. CONDOR is a derivate-free optimization tool (i.e., the derivatives of F(x) are not required. The only information needed about the objective function is a simple method (written in Fortran, C++,...) or a program (a Unix, Windows, Solaris,... executable) which can evaluate the objective function F(x) at a given point x. The algorithm has been specially developed to be very robust against noise inside the evaluation of the objective function F(x). This hypotheses are very general, the algorithm can thus be applied on a vast number of situations. CONDOR is able to use several CPU's in a cluster of computers. Different computer architectures can be mixed together and used simultaneously to deliver a huge computing power. The optimizer will make simultaneous evaluations of the objective function F(x) on the available CPU's to speed up the optimization process. The experimental results are very encouraging and validate the quality of the approach: CONDOR outperforms many commercial, high-end optimizer and it might be the fastest optimizer in its category (fastest in terms of number of function evaluations). When several CPU's are used, the performances of CONDOR are currently unmatched (may 2004). CONDOR has been used during the METHOD project to optimize the shape of the blades inside a Centrifugal Compressor (METHOD stands for Achievement Of Maximum Efficiency For Process Centrifugal Compressors THrough New Techniques Of Design). In this project, the objective function is based on a 3D-CFD (computation fluid dynamic) code which simulates the flow of the gas inside the compressor.

[1]  Nicholas I. M. Gould,et al.  SQP Methods for Large-Scale Nonlinear Programming , 1999, System Modelling and Optimization.

[2]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[3]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

[4]  Nicholas I. M. Gould,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

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

[6]  C. Kelley,et al.  Yield optimization using a GaAs process simulator coupled to a physical device model , 1992 .

[7]  Valentino Pediroda,et al.  Multi objective optimisation examples: Design of a laminar airfoil and of a composite rectangular wing , 2000 .

[8]  C. T. Kelley,et al.  An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima , 1995, SIAM J. Optim..

[9]  J. M. Peña On the Multivariate Horner Scheme , 2000, SIAM J. Numer. Anal..

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

[11]  R. A. Lorentz,et al.  Multivariate Hermite interpolation by algebraic polynomials: a survey , 2000 .

[12]  M. J. D. Powell,et al.  Least Frobenius norm updating of quadratic models that satisfy interpolation conditions , 2004, Math. Program..

[13]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[14]  H. H. Rosenbrock,et al.  An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

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

[16]  C. D. Boor,et al.  Box splines , 1993 .

[17]  Paul T. Boggs,et al.  Sequential Quadratic Programming , 1995, Acta Numerica.

[18]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[19]  C. D. Boor,et al.  On multivariate polynomial interpolation , 1990 .

[20]  Hector A. Rosales-Macedo Nonlinear Programming: Theory and Algorithms (2nd Edition) , 1993 .

[21]  Tomas Sauer,et al.  Computational aspects of multivariate polynomial interpolation , 1995, Adv. Comput. Math..

[22]  Hugues Bersini,et al.  Direct adaptive fuzzy control for MIMO processes , 2000, Ninth IEEE International Conference on Fuzzy Systems. FUZZ- IEEE 2000 (Cat. No.00CH37063).

[23]  John E. Dennis,et al.  Optimization Using Surrogate Objectives on a Helicopter Test Example , 1998 .

[24]  C. Kelley,et al.  The Simplex Gradient and Noisy Optimization Problems , 1998 .

[25]  J. Dennis,et al.  Direct Search Methods on Parallel Machines , 1991 .

[26]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[27]  M. Powell The use of Band Matrices for Second Derivative Approximations in Trust Region Algorithms , 1998 .

[28]  R. H. Myers Classical and modern regression with applications , 1986 .

[29]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[30]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.