Quadratic Programming Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 4: | Line 4: | ||
** a [[Linear Programming Task]]. | ** a [[Linear Programming Task]]. | ||
* <B>See:</B> [[Objective Function]], [[Quadratically Constrained Quadratic Programming Problem]], [[Non-Linear Programming Problem]], [[Nonconvex Quadratic Program]]. | * <B>See:</B> [[Objective Function]], [[Quadratically Constrained Quadratic Programming Problem]], [[Non-Linear Programming Problem]], [[Nonconvex Quadratic Program]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 17:49, 23 September 2021
A Quadratic Programming Task is an optimization task that accepts a quadratic optimization problem.
- …
- Counter-Example(s):
- See: Objective Function, Quadratically Constrained Quadratic Programming Problem, Non-Linear Programming Problem, Nonconvex Quadratic Program.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/quadratic_programming Retrieved:2015-9-27.
- Quadratic programming (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.