| Display title | Quadratically constrained quadratic program |
| Default sort key | Quadratically constrained quadratic program |
| Page length (in bytes) | 6,929 |
| Namespace ID | 0 |
| Page ID | 191698 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Wikisleeper |
| Date of page creation | 23:45, 6 February 2024 |
| Latest editor | imported>Wikisleeper |
| Date of latest edit | 23:45, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form
$ {\begin{aligned}&{\text{minimize}}&&{\tfrac {1}{2}}x^{\mathrm {T} }P_{0}x+q_{0... |
