The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/31658809
Record Status Checked
Record Id 31658809
Title QPLIB: a library of quadratic programming instances
Abstract 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, the constrains, or both are quadratic. QP is a very "varied" class of problems, comprising sub-classes of problems ranging from trivial to undecidable. Solution methods for QP are very diverse, ranging from entirely combinatorial ones to completely continuous ones, including many 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 many different interested communities is therefore important. We propose a simple taxonomy for QP instances that leads 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.
Organisation STFC , SCI-COMP
Funding Information
Related Research Object(s): 42679083
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Preprint RAL Preprints RAL-P-2017-003, Mathematical Programming Computation 2017. RAL-P-2017-003.pdf 2017