This Title All WIREs
How to cite this WIREs title:
WIREs Comp Stat

Quadratic programming

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

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.1344 This article is categorized under: Algorithms and Computational Methods > Quadratic and Nonlinear Programming

Browse by Topic

Algorithms and Computational Methods > Quadratic and Nonlinear Programming

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts