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 条
  • [21] APPROXIMATIONS FOR CHROMATIC POLYNOMIALS
    BIGGS, NL
    MEREDITH, GHJ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (01) : 5 - 19
  • [22] On the bad points of positive semidefinite polynomials
    Olivier Benoist
    Mathematische Zeitschrift, 2022, 300 : 3383 - 3403
  • [23] Positive semidefinite univariate matrix polynomials
    Christoph Hanselka
    Rainer Sinn
    Mathematische Zeitschrift, 2019, 292 : 83 - 101
  • [24] A Novel Set of Moment Invariants for Pattern Recognition Applications Based on Jacobi Polynomials
    Rocha Angulo, Rafael Augusto
    Martin Carpio, Juan
    Rojas-Dominguez, Alfonso
    Ornelas-Rodriguez, Manuel
    Puga, Hector
    PATTERN RECOGNITION (MCPR 2020), 2020, 12088 : 139 - 148
  • [25] Semidefinite approximations for global unconstrained polynomial optimization
    Jibetean, D
    Laurent, M
    SIAM JOURNAL ON OPTIMIZATION, 2005, 16 (02) : 490 - 514
  • [26] Semidefinite Approximations of Conical Hulls of Measured Sets
    Romero, Julian
    Velasco, Mauricio
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 57 (01) : 71 - 103
  • [27] Semidefinite Approximations of Conical Hulls of Measured Sets
    Julián Romero
    Mauricio Velasco
    Discrete & Computational Geometry, 2017, 57 : 71 - 103
  • [28] Convex approximations in stochastic programming by semidefinite programming
    Deak, Istvan
    Polik, Imre
    Prekopa, Andras
    Terlaky, Tamas
    ANNALS OF OPERATIONS RESEARCH, 2012, 200 (01) : 171 - 182
  • [29] Eigenvalue and semidefinite approximations for graph partitioning problem
    Povh, Janez
    SOR'07: PROCEEDINGS OF THE 9TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2007, : 95 - 100
  • [30] A Hierarchy of Polyhedral Approximations of Robust Semidefinite Programs
    Louca, Raphael
    Bitar, Eilyan
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 7056 - 7062