High Quality Content by WIKIPEDIA articles! 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. The quadratic programming problem can be formulated as: Assume x belongs to mathbb{R}^{n} space. The nxn matrix Q is symmetric, and c is any nx1 vector. Minimize (with respect to x) f(mathbf{x}) = tfrac{1}{2} mathbf{x}^T Qmathbf{x} + mathbf{c}^T mathbf{x}

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.