Abstract
This paper is based on a recent work by Kojima which extended sums of squares relaxations of polynomial optimization problems to polynomial semidefinite programs. Let \(\varepsilon\) and \(\varepsilon_{+}\) be a finite dimensional real vector space and a symmetric cone embedded in \(\varepsilon\); examples of \(\varepsilon\) and \(\varepsilon_{+}\) include a pair of the N-dimensional Euclidean space and its nonnegative orthant, a pair of the N-dimensional Euclidean space and N-dimensional second-order cones, and a pair of the space of m × m real 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 \(\varepsilon_{+}\), i.e., a minimization of a real valued polynomial a(x) in the n-dimensional real variable vector x over a compact feasible region \(\{ {\bf x} : b({\bf x}) \in \varepsilon_{+}\}\), where b(x) denotes an \(\varepsilon\)- valued polynomial in x. It is shown under a certain moderate assumption on the \(\varepsilon\)-valued polynomial b(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.
Similar content being viewed by others
References
Alizadeh F., Goldfarb D. (2003) Second-order cone programming. Math. Program. 95: 3–51
Curto R.E., Fialkow L.A. (2000) The truncated complex K-moment problem. Trans. Am. Math. Soc. 352: 2825–2855
Faybusovich L. (1997) Euclidean Jordan algebras and interior-point algorithms. J. Positivity 1: 331–357
Faybusovich L.(1997) Linear systems in jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86: 149–175
Faraut J., Korányi A. (1994) Analysis on symmetric cones. Oxford University Press, New York
Henrion D., Lasserre J.B. (2003) GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Software 29(2): 165–194
Henrion D., Lasserre J.B. (2006) Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Automat. Cont. 51(2): 192–202
Hol C.W.J., Scherer C.W. Sum of squares relaxations for polynomial semi-definite programming. In: De Moor B., Motmans B. (eds.) Proceedings of the 16th International Symposium on Mahematical Theory of Networks and Systems. Leuven, Belgium, 5–9 July, 2004, pp. 1–10
Kim S., Kojima M., Waki H. (2005) Generalized Lagrangian duals and sums of squares relaxation of sparse polynomial optimization problems. SIAM J. Optim. 15(3): 697–719
Kojima M. Sums of squares relaxations of polynomial semidefinite programs. Research Report B-397, Dept. of Mathematical and computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo 152-8552, November 2003
Kojima M., Kim S., Waki H. (2003) A general framework for convex relaxation of polynomial optimization problems over cones. J. Oper. Res. Soc. Japan 46(2): 125–144
Kojima M., Kim S., Waki H. (2004) Sparsity in sums of squares of polynomials. Math. Program. 103(1): 45–62
Lasserre J.B. (2001) Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11: 796–817
Muramatsu M. (2002) On a commutative class of search directions for linear programming over symmetric cones. J. Optim. Theory Appl. 112(3): 595–625
Nesterov Y.E., Todd M.J. (1998) Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8: 324–364
Parrilo P.A. (2003) Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96: 293–320
Prajna S., Papachristodoulou A., Parrilo P.A.: SOSTOOLS: sum of squares optimization toolbox for MATLAB – user’s guide. Control and Dynamical Systems, California Institute of Technology, Pasadena, CA 91125 USA, 2002
Putinar M. (1993) Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42: 969–984
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by Grant-in-Aid for Scientific Research on Priority Areas 16016234.
Rights and permissions
About this article
Cite this article
Kojima, M., Muramatsu, M. An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. Math. Program. 110, 315–336 (2007). https://doi.org/10.1007/s10107-006-0004-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0004-5