The Documentation Scheme

Abstract

The development of algorithms for solving the nonlinear programming problem

$$ \begin{gathered} \min f(x) \hfill \\ g_j (x) \geqslant 0,\quad j = 1, \ldots ,m_1 \hfill \\ x \in \mathbb{R}^n :g_j (x) = 0,\quad j = m_1 + 1, \ldots ,m \hfill \\ x_1 \leqslant x \leqslant x_u \hfill \\ \end{gathered} $$

(NLP)

with continuously differentiable functions f and g₁,…,g_m requires the availability of test examples. The intention is to present a collection of optimization problems which can be used by a test designer to choose from either to develop a new algorithm or to become familar with an existing code written by somebody else. All problems were found in the literature and have been used in the past to test or compare optimization software.