1. Guide to Software: "Decision Tree"
        2. Software Archive
        3. Software Evaluation: "Benchmarks"
        4. Archive of Testproblems
        5. Web-based Solvers (1/3 of NEOS)

• Software, Testproblem Archives
• Our NEOS Solvers
• Report on recent benchmarks in
  mostly discrete optimization
  • MILP, MIQP     commercial and free
  • MINLP     GAMS Performance Tools
  • SDP                 DIMACS, sparse SDP
• Conclusions

• held in ftp area
• DONLP2 (NLP-SQP) and other software
• some f90 versions
• binaries (source not public)
• codes not available otherwise

• benchmark problems not available elsewhere
• converted formats
• large library of AMPL models
• miscellaneous

• MILP, MIQP
• convex QP
• smooth & nonsmooth NLP
• nonlinear systems
• PDE-constrained NLP

• BPMPD, MOSEK

• BonsaiG, GLPK

• ACCPM, BT, DFO, NDA

• DONLP2

• CirCut, CSDP, MOSEK, PENNON, SDPA, SDP-LR, SDPT3, SeDuMi

• NSIPS

• GLCF, GLOBMIN

• Benchmark Policy
  • absolute reproducibility
  • datafiles, codes available
  • default options
  • (some) logfiles posted
• Selected Benchmarks
  • Integer Programming
    • MILP benchmark
    • MIQP benchmark
    • small MINLP benchmark
    • some medium-sized MINLP problems
  • SDP/SOCP Programming
    • The original DIMACS benchmark
    • Newer SDP/SOCP-codes on the 7th DIMACS Challenge problems
    • Several SDP-codes on sparse SDP problems

• MILP:
  CPLEX, XPRESS competitive, GLPK decent in B&B
• MIQP:
  CPLEX seems to have edge, see new XPRESS, MOSEK
• MINLP:
  DICOPT, MINLP, SBB competitive
• SDP/SOCP:
  CSDP, SDPA improved for large, sparse problems,
  MOSEK, PENNON, SDPT3, SeDuMi have clear strenghts