Metraipolis › archive › dc_eaef56187091
Quadratically constrained quadratic program — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T18:06:29.946Z
- SHA-256 of the archived text
bb0b2ebb15b187ddf7a8e87320ab8a7e49e0d000bdd9e283e641677dd24b0310- Stable URL of this page
https://metraipolis.com/documento/dc_eaef56187091
How to cite
Quadratically constrained quadratic program — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_eaef56187091 (Metraipolis archive dc_eaef56187091, sha256 bb0b2ebb15b187ddf7a8e87320ab8a7e49e0d000bdd9e283e641677dd24b0310)
BibTeX
@misc{dceaef56187091,
title = {Quadratically constrained quadratic program — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_eaef56187091; sha256 bb0b2ebb15b187ddf7a8e87320ab8a7e49e0d000bdd9e283e641677dd24b0310},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 minimize 1 2 x T P 0 x + q 0 T x subject to 1 2 x T P i x + q i T x + r i ≤ 0 for i = 1 , … , m , A x = b , {\displaystyle {\begin{aligned}&{\text{minimize}}&&{\tfrac {1}{2}}x^{\mathrm {T} }P_{0}x+q_{0}^{\mathrm {T} }x\\&{\text{subject to}}&&{\tfrac {1}{2}}x^{\mathrm {T} }P_{i}x+q_{i}^{\mathrm {T} }x+r_{i}\leq 0\quad {\text{for }}i=1,\dots ,m,\\&&&Ax=b,\end{aligned}}} where P0, ..., Pm are n-by-n matrices and x ∈ Rn is the optimization variable. If P0, ..., Pm are all positive semidefinite, then the problem is convex. If these matrices are neither positive nor negative semidefinite, the problem is non-convex. If P1, ... ,Pm are all zero, then the constraints are in fact linear and the problem is a quadratic program.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Quadratically constrained quadratic program» — https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program
Wikidata Q7268373 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7268373
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quadratically_constrained_quadratic_program?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1304340409, consultata il 2026-10-06T16:31:53.295Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 69f87e68a566c5c76b6c78d1640784708d4fb47fc898c88849b989ce3cb67bb7