A server for automated performance analysis of benchmarking data
From MaRDI portal
Publication:3377976
DOI10.1080/10556780500065366zbMath1181.90309OpenAlexW2125184533MaRDI QIDQ3377976
Armin Pruessner, Hans D. Mittelmann
Publication date: 29 March 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500065366
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99) Internet topics (68M11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (6)
Best practices for comparing optimization algorithms ⋮ Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Nonlinear optimization with GAMS /LGO ⋮ PAVER 2.0: an open source environment for automated performance analysis of benchmarking data ⋮ MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover
Uses Software
Cites Work
- A comparison of large scale mixed complementarity problem solvers
- An independent benchmarking of SDP and SOCP solvers
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Solving Real-World Linear Programs: A Decade and More of Progress
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- Benchmarking interior point Lp/Qp solvers
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A server for automated performance analysis of benchmarking data
