Testing Unconstrained Optimization Software
Jorge J. Morè, B. S. Garbow, K. E. Hillstrom · ACM Transactions on Mathematical Software · 1981
Much of the testing of optimization software is inadequate because the number of test functmns is small or the starting points are close to the solution.In addition, there has been too much emphasm on measurmg the efficmncy of the software and not enough on testing reliability and robustness.To address this need, we have produced a relatwely large but easy-to-use collection of test functions and designed gmdelines for testing the reliability and robustness of unconstrained optimization software.
Cited by 1,527 works. doi:10.1145/355934.355936 Open-access PDF
Authors
References
- A Rapidly Convergent Descent Method for Minimization
- An Automatic Method for Finding the Greatest or Least Value of a Function
- An Iterative Method for Finding Stationary Values of a Function of Several Variables
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- The Levenberg-Marquardt algorithm: Implementation and theory
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Function Minimization Without Evaluating Derivatives--a Review
- Numerical Solution of Systems of Nonlinear Equations
- Application of Stepwise Regression to Non-Linear Estimation