Journal of Optimization Theory and Applications

, Volume 159, Issue 1, pp 57–68

Moment Approximations for Set-Semidefinite Polynomials

Article
  • 219 Downloads

Abstract

The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them set-semidefinite) have many uses in optimization. A common example of this type set is the set of copositive matrices, where we are effectively considering nonnegativity over the entire nonnegative orthant and are restricted to homogeneous polynomials of degree two. Lasserre (SIAM J. Optim., 21(3):864–885, 2011) has previously considered a method using moments in order to provide an outer approximation to this set, for nonnegativity over a general subset of the real space. In this paper, we shall show that, in the special case of considering nonnegativity over a subset of the nonnegative orthant, we can provide a new outer approximation hierarchy. This is based on restricting moment matrices to be completely positive, and it is at least as good as Lasserre’s method. This can then be relaxed to give tractable approximations that are still at least as good as Lasserre’s method. In doing this, we also provide interesting new insights into the use of moments in constructing these approximations.

Keywords

Nonnegative polynomials Set-semidefinite polynomials Copositive programming Doubly nonnegative matrices Moments Completely positive matrices 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Johann Bernoulli InstituteUniversity of GroningenGroningenThe Netherlands
  2. 2.Faculty of information studies in Novo mestoUlica talcev 3Novo mestoSlovenia

Personalised recommendations