Optimization Online


Moment approximations for set-semidefinite polynomials

Peter Dickinson (p.j.c.dickinson***at***rug.nl)
Janez Povh (janez.povh***at***fis.unm.si)

Abstract: The set of polynomials which 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 of set is the set of copositive matrices, where effectively we are considering nonnegativity over the entire nonnegative orthant and we limit the polynomials to be homogeneous of degree two. Lasserre in A new look at nonnegativity on closed sets and polynomial optimization, SIAM Journal of Optimization, 21 (2011), has previously provided a method using moments to provide an outer approximation to this cone for a general subset of the real space, not necessarily contained in the nonnegative orthant. In this paper we show that in the special case of considering nonnegativity over a subset of the nonnegative orthant, we can provide a new outer approximation hierarchy based on the completely positive moment matrices, which is a new idea and implies other approximations which are at least as good as that provided by Lasserre. We also provide an interesting new insight into the use of moments for constructing these approximations.

Keywords: moments, nonnegative polynomials, copositive programming, doubly nonnegative matrices

Category 1: Linear, Cone and Semidefinite Programming (Other )



Entry Submitted: 06/02/2012
Entry Accepted: 06/02/2012
Entry Last Modified: 03/08/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society