Algebraic Degree of Polynomial Optimization

Details Algebraic Degree of Polynomial Optimization Algebraic Degree of Polynomial Optimization

2008-02-09

arxiv.org/abs/0802.1233v1

Mathematics

Optimization and Control

13 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algebraic Degree of Polynomial Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Degree of Polynomial Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Degree of Polynomial Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402644