An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
复制标题
DOI:
10.1007/s10107-006-0004-5
复制
发表时间:
2007-03
影响因子:
2.7
通讯作者:
M. Kojima;M. Muramatsu
中科院分区:
文献类型:
--
作者:
M. Kojima;M. Muramatsu
This paper is based on a recent work by Kojima which extended sums of squares relaxations of polynomial optimization problems to polynomial semidefinite programs. Letandbe a finite dimensional real vector space and a symmetric cone embedded in; examples ofandinclude a pair of theN-dimensional Euclidean space and its nonnegative orthant, a pair of theN-dimensional Euclidean space andN-dimensional second-order cones, and a pair of the space ofm×mreal symmetric (or complex Hermitian) matrices and the cone of their positive semidefinite matrices. Sums of squares relaxations are further extended to a polynomial optimization problem over, i.e., a minimization of a real valued polynomiala(x) in then-dimensional real variable vectorxover a compact feasible region, whereb(x) denotes an- valued polynomial inx. It is shown under a certain moderate assumption on the-valued polynomialb(x) that optimal values of a sequence of sums of squares relaxations of the problem, which are converted into a sequence of semidefinite programs when they are numerically solved, converge to the optimal value of the problem.