Journal
MATHEMATICAL PROGRAMMING COMPUTATION
Volume 11, Issue 2, Pages 237-265Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-018-0147-4
Keywords
Instance library; Quadratic programming; Mixed-Integer Quadratically Constrained Quadratic Programming; Binary quadratic programming
Categories
Funding
- Gaspard Monge Program for Optimization and operations research (PGMO)
- COST Action [TD1207]
- Research Campus MODAL Mathematical Optimization and Data Analysis Laboratories - Federal Ministry of Education and Research (BMBF) [05M14ZAM]
- EPSRC [EP/M025179/1]
- EPSRC [EP/M025179/1] Funding Source: UKRI
Ask authors/readers for more resources
This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the objective function and/or the constraints are quadratic. QP is a very diverse class of problems, comprising sub-classes ranging from trivial to undecidable. This diversity is reflected in the variety of QP solution methods, ranging from entirely combinatorial approaches to completely continuous algorithms, including many methods for which both aspects are fundamental. Selecting a set of instances of QP that is at the same time not overwhelmingly onerous but sufficiently challenging for the different, interested communities is therefore important. We propose a simple taxonomy for QP instances leading to a systematic problem selection mechanism. We then briefly survey the field of QP, giving an overview of theory, methods and solvers. Finally, we describe how the library was put together, and detail its final contents.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available