   Next: The Codes Up: Introduction Previous: The Problems Solved

## Computing Errors

Suppose that we are given approximate optimal solutions of ($SQLP-P$) and ($SQLP-D$), respectively. To compute how far they are from an exact solution pair, we define a norm on , and a minimum eigenvalue w.r.t. the cone . Precisely, if , then where for a matrix , is the Frobenius norm of . Also, where
• for a symmetric matrix , is the usual smallest eigenvalue of .
• for a vector , .
Also, we denote by the absolute value of the largest component of , for an arbitrary .

Then, for approximate optimal solutions of ($SQLP-P$) and of ($SQLP-D$), we define               Furthermore, when and are both in , that is , we also define   A few remarks are in order.
• If and are both feasible, then in exact arithmetic .
• As and are approximate optimal solutions only, we may have . It is possible that all other error measures being the same, if with corresponds to a solution that is worse'', than as if was . Thus, we decided to report , not merely the maximum of and 0 (as it is done in several papers), so as not to suppress any information.
• Several codes do not explicitly maintain ; in this case, one should set Of course, then will be zero (depending on the accuracy achieved by the computer).

In the error tables below and are always listed. is only given when nonzero and only when in the digits shown different from . is not available for SDPA.

From the time the benchmark problems for the Challenge were published until the time the papers for this volume were due we have performed an evaluation of the codes on all the benchmark problems each code could solve. In most cases we had the latest version of the codes which the authors themselves used and on which their contributions to the volume are based. An exception is the code SDPA. Its authors are reporting about work done after release of their software and which is not yet available in coded form. The codes BMPR and BMZ were released once and not updated. All remaining codes were updated at least once, several at the time of the workshop or thereafter. Substantial changes were done with DSDP which evolved from a special code for discrete graph problems to a general purpose SDP solver accepting also standard sparse SDPA input format. Further quite remarkable improvements were applied to SDPT3, BUNDLE, and CSDP.

These benchmark results are meant to yield a rough overview of how the tested codes performed on the same, standard platform, a Sun Ultra 60 with Solaris 8, 2 GB of memory, and a 450 MHz processor. Paging was avoided. In the following section first basic information is given on each participating code. Then, as provided by the authors, a short description follows of the code itself, the stopping criteria used, and the perceived strengths and weaknesses. In the third section the test problems are listed followed by some remarks regarding the performance of the codes. Appended are tables with problem statistics and the benchmark results.   Next: The Codes Up: Introduction Previous: The Problems Solved
Hans D. Mittelmann 2002-08-17