CUTE
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 21 (1) , 123-160
- https://doi.org/10.1145/200979.201043
Abstract
The purpose of this article is to discuss the scope and functionality of a versatile environment for testing small- and large-scale nonlinear optimization algorithms. Although many of these facilities were originally produced by the authors in conjunction with the software package LANCELOT, we believe that they will be useful in their own right and should be available to researchers for their development of optimization software. The tools can be obtained by anonymous ftp from a number of sources and may, in many cases, be installed automatically. The scope of a major collection of test problems written in the standard input format (SIF) used by the LANCELOT software package is described. Recognizing that most software was not written with the SIF in mind, we provide tools to assist in building an interface between this input format and other optimization packages. These tools provide a link between the SIF and a number of existing packages, including MINOS and OSL. Additionally, as each problem includes a specific classification that is designed to be useful in identifying particular classes of problems, facilities are provided to build and manage a database of this information. There is a Unix and C shell bias to many of the descriptions in the article, since, for the sake of simplicity, we do not illustrate everything in its fullest generality. We trust that the majority of potential users are sufficiently familiar with Unix that these examples will not lead to undue confusion.Keywords
This publication has 13 references indexed in Scilit:
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear InterpolationPublished by Springer Nature ,1994
- Algorithm 709: testing algorithm implementationsACM Transactions on Mathematical Software, 1992
- Tensor Methods for Unconstrained Optimization Using Second DerivativesSIAM Journal on Optimization, 1991
- An Algorithm for Large-Scale Quadratic ProgrammingIMA Journal of Numerical Analysis, 1991
- On the Solution of Large Quadratic Programming Problems with Bound ConstraintsSIAM Journal on Optimization, 1991
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989
- A Strategy for Global Convergence in a Sequential Quadratic Programming AlgorithmSIAM Journal on Numerical Analysis, 1989
- A modular system of algorithms for unconstrained minimizationACM Transactions on Mathematical Software, 1985
- Testing Unconstrained Optimization SoftwareACM Transactions on Mathematical Software, 1981
- Large-scale linearly constrained optimizationMathematical Programming, 1978