Abstract

Optimization problems in which a quadratic objective function is optimized subject to linear constraints on the parameters are known as quadratic programming problems (QPs). This focus article reviews algorithms for convex QPs (in which the objective is a convex function) and provides pointers to various online resources about QPs. WIREs Comput Stat 2015, 7:153–159. doi: 10.1002/wics.1344This article is categorized under: Algorithms and Computational Methods > Quadratic and Nonlinear Programming

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call