Testing Unconstrained Optimization Software

1981/03/01 by Jorge J. Moré, Jorge J. Morè, Burton S. Garbow +3 · 1,524 citations
Computer Science · Engineering · Mathematics · #Advanced Multi-Objective Optimization Algorithms #Advanced Optimization Algorithms Research #Computer science #Engineering #Engineering physics #Library science #National laboratory #Numerical Methods and Algorithms #Operating system

paper · pdf · doi:10.1145/355934.355936

published in ACM Transactions on Mathematical Software 7(1), 17-41 (Association for Computing Machinery)

openalex publication_date 1981/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

• A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
• When Rates Are Geometric: Rate-Certificate Transfer for Contact Splittings in Optimization
• New Globalized Newton-Type Methods for Nonconvex Optimization Problems
• Robust Gradient Descent via Heavy-Ball Momentum with Predictive Extrapolation
• AutoGD: Automatic Learning Rate Selection for Gradient Descent
• A Partially Derivative-Free Proximal Method for Composite Multiobjective Optimization in the Hölder Setting
• A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
• A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
• Dynamic Proximal Point Method for Unconstrained Minimization
• COCO: a platform for comparing continuous optimizers in a black-box setting
• A generalized worst-case complexity analysis for non-monotone line searches
• Algorithm 795
• Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations