next up previous
Next: Example 1 Up: paper Previous: Optimization codes and modeling

Numerical examples

We discuss numerical solutions for elliptic problems with the following specifications: the domain is the unit square $\, \Omega = (0,1) \times (0,1)\,$ and the control and state constraints are box constraints of the form (2.16). For each example a table is given listing the following for different gridsizes: Number of iterations and CPU time in seconds needed by LOQO (including AMPL), the number of accurate digits in the computed optimal objective function value, and this number. More detailed results including a comparison with the other solvers mentioned are exemplarily given for Examples 4 and 5.


Hans D. Mittelmann