Algebraic Degree of Polynomial Optimization
| dc.creator | Nie, Jiawang | |
| dc.creator | Ranestad, Kristian | |
| dc.date | 2008-02-09 | |
| dc.date.accessioned | 2026-07-07T09:19:46Z | |
| dc.date.available | 2026-07-07T09:19:46Z | |
| dc.description | Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on optimizers, and the coordinates of optimizers are algebraic functions of the coefficients of the input polynomials. We also give a general formula for the algebraic degree of the optimal coordinates. The derivation of the algebraic degree is equivalent to counting the number of all complex critical points. As special cases, we obtain the algebraic degrees of quadratically constrained quadratic programming (QCQP), second order cone programming (SOCP) and $p$-th order cone programming (pOCP), in analogy to the algebraic degree of semidefinite programming. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/0802.1233 | |
| dc.identifier | http://arxiv.org/abs/0802.1233 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154514 | |
| dc.subject | Optimization and Control | |
| dc.subject | Algebraic Geometry | |
| dc.title | Algebraic Degree of Polynomial Optimization | |
| dc.type | text |