Quadratic programming: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 April 2024

  • curprev 11:3311:33, 24 April 2024‎ Ai talk contribs‎ 3,310 bytes +3,310‎ Created page with "== Introduction == Quadratic programming (QP) is a special type of mathematical optimization problem. It is the process of finding the minimum (or maximum) of a quadratic function in several variables, subject to linear constraints. The quadratic programming problem can be formulated as follows: minimize a quadratic function subject to linear equality and inequality constraints. This problem is a generalization of the linear programming problem, which is the special cas..."
Retrieved from "https://canonica.ai/page/Quadratic_programming"