A Simulation Test Approach to the Evaluation of Nonlinear Optimization Algorithms

A simulation test methodology was developed to evaluate unconstrained nonlinear optimization computer algorithms. The test technique simulates problems optimization algorithms encounter in practice by employing a repertoire of problems representing various topographies (descending curved valleys, saddle points, ridges, etc.), dimensions, degrees of nonlinearity (e.g., linear to exponential) and minima, addressing them from various randomly generated initial approximations to the solution and recording their performances in the form of statistical summaries. These summaries, consisting of categorized results and statistical averages, are generated for each algorithm as tested over members of the problem set. The individual tests are composed of a series of runs from random starts over a member of the problem set. Descriptions of the test technique, test problem, and test results are provided. 3 figures, 2 tables.

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

[2]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[3]  C. G. Broyden.  A Class of Methods for Solving Nonlinear Simultaneous Equations , 1965 .

[4]  Mjd Powell,et al.  A Fortran subroutine for solving systems of non-linear algebraic equations , 1968 .

[5]  M. Powell.  A New Algorithm for Unconstrained Optimization , 1970 .

[6]  R. Fletcher.  A modified Marquardt subroutine for non-linear least squares , 1971 .

[7]  Roger Fletcher,et al.  FORTRAN subroutines for minimization by quasi-Newton methods , 1972 .

[8]  R. Fletcher.  Methods for the solution of optimization problems , 1972 .

[9]  Kenneth M. Brown,et al.  COMPUTER ORIENTED ALGORITHMS FOR SOLVING SYSTEMS OF SIMULTANEOUS NONLINEAR ALGEBRAIC EQUATIONS**This work was supported in part by the National Science Foundation under Grant GJ-32552 and in part by the University Computer Center of the University of Minnesota. , 1973 .

[10]  Thomas John Aird.  Computational solution of global nonlinear least-squares problems. , 1973 .

[11]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[12]  William C. Davidon,et al.  Optimally conditioned optimization algorithms without line searches , 1975, Math. Program..

[13]  Kenneth E. Hillstrom.  Simulation Test Approach to the Evaluation and Comparison of Unconstrained Nonlinear Optimization Algorithms , 1976 .