Moment Approximations for Set-Semidefinite Polynomials

被引:4
|
作者
Dickinson, Peter J. C. [1 ]
Povh, Janez [2 ]
机构
[1] Univ Groningen, Johann Bernoulli Inst, NL-9700 AK Groningen, Netherlands
[2] Fac Informat Studies Novo Mesto, Novo Mesto 8000, Slovenia
关键词
Nonnegative polynomials; Set-semidefinite polynomials; Copositive programming; Doubly nonnegative matrices; Moments; Completely positive matrices; OPTIMIZATION; MATRICES; GRAPH;
D O I
10.1007/s10957-013-0279-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:57 / 68
页数:12
相关论文
共 50 条
  • [1] Moment Approximations for Set-Semidefinite Polynomials
    Peter J. C. Dickinson
    Janez Povh
    Journal of Optimization Theory and Applications, 2013, 159 : 57 - 68
  • [2] Set-Semidefinite Optimization
    Eichfelder, Gabriele
    Jahn, Johannes
    JOURNAL OF CONVEX ANALYSIS, 2008, 15 (04) : 767 - 801
  • [3] A note on set-semidefinite relaxations of nonconvex quadratic programs
    Ahmed, Faizan
    Still, Georg
    JOURNAL OF GLOBAL OPTIMIZATION, 2013, 57 (04) : 1139 - 1146
  • [4] A note on set-semidefinite relaxations of nonconvex quadratic programs
    Faizan Ahmed
    Georg Still
    Journal of Global Optimization, 2013, 57 : 1139 - 1146
  • [5] ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS
    Eichfelder, Gabriele
    Povh, Janez
    CROATIAN OPERATIONAL RESEARCH REVIEW, 2010, 1 (01) : 26 - 39
  • [6] ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS
    Eichfelder, Gabriele
    Povh, Janez
    CROATIAN OPERATIONAL RESEARCH REVIEW (CRORR), VOL 1, 2010, 1 : 26 - +
  • [7] On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
    Eichfelder, Gabriele
    Povh, Janez
    OPTIMIZATION LETTERS, 2013, 7 (06) : 1373 - 1386
  • [8] On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
    Gabriele Eichfelder
    Janez Povh
    Optimization Letters, 2013, 7 : 1373 - 1386
  • [9] Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
    Peter J. C. Dickinson
    Gabriele Eichfelder
    Janez Povh
    Optimization Letters, 2013, 7 (6) : 1387 - 1397
  • [10] A hierarchy of LMI inner approximations of the set of stable polynomials
    Ait Rami, Mustapha
    Henrion, Didier
    AUTOMATICA, 2011, 47 (07) : 1455 - 1460