Quadratic programming
Copyright policy )Quadratic programming
Optimization problems in which a quadratic objective function is optimized subject to linear constraints on the parameters are known asquadratic programming problems(QPs). This focus article reviews algorithms for convexQPs(in which the objective is a convex function) and provides pointers to various online resources aboutQPs.WIREs Comput Stat2015, 7:153–159. doi: 10.1002/wics.1344This article is categorized under:Algorithms and Computational Methods > Quadratic and Nonlinear Programming
- University of the Sciences United States
- University of Wisconsin–Madison United States
- University of Western Australia Australia
active-set methods, interior-point algorithms, quadratic programming, conditional-gradient algorithms, Computational methods for problems pertaining to statistics, optimization
active-set methods, interior-point algorithms, quadratic programming, conditional-gradient algorithms, Computational methods for problems pertaining to statistics, optimization
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!