TRACE OPTIMIZATION USING SEMIDEFINITE PROGRAMMING

被引：0
|
作者：
Cafuta, Kristijan [1 ]
Klep, Igor [2 ,3 ]
Povh, Janez [4 ]
机构：
[1] Univ Ljubljana, Fac Elect Engn, Trzaska 25, Ljubljana 1000, Slovenia
[2] Univ Maribor, Fac Nat Sci & Math, SLO-2000 Maribor, Slovenia
[3] Univ Ljubljana, Fac Math & Phys, Ljubljana 1111, Slovenia
[4] Fac Informat Studies Novo Mesto, Novo Mesto 8000, Slovenia
来源：
SOR'11 PROCEEDINGS: THE 11TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA | 2011年
关键词：
noncommutative polynomial; sum of squares; semidefinite programming; Matlab toolbox; free positivity; NONCOMMUTATIVE POLYNOMIALS; HERMITIAN SQUARES; SUMS; RELAXATIONS;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we present the algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. It is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allow us to use semidefinite programming.
引用
收藏
页码：95 / 101
页数：7
相关论文
共 50 条
  • [41] Relaxations of the Satisfiability Problem Using Semidefinite Programming
    Etienne de Klerk
    Hans van Maaren
    Joost P. Warners
    Journal of Automated Reasoning, 2000, 24 : 37 - 65
  • [42] Graph partitioning using linear and semidefinite programming
    Lisser, A
    Rendl, E
    MATHEMATICAL PROGRAMMING, 2003, 95 (01) : 91 - 101
  • [43] Testing the nullspace property using semidefinite programming
    Alexandre d’Aspremont
    Laurent El Ghaoui
    Mathematical Programming, 2011, 127 : 123 - 144
  • [44] Unsupervised Fault Detection Using Semidefinite Programming
    Lopez, J. A.
    Sznaier, M.
    Camps, O.
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 3798 - 3803
  • [45] Ensemble clustering using semidefinite programming with applications
    Singh, Vikas
    Mukherjee, Lopamudra
    Peng, Jiming
    Xu, Jinhui
    MACHINE LEARNING, 2010, 79 (1-2) : 177 - 200
  • [46] Ensemble clustering using semidefinite programming with applications
    Vikas Singh
    Lopamudra Mukherjee
    Jiming Peng
    Jinhui Xu
    Machine Learning, 2010, 79 : 177 - 200
  • [47] SparsePOP - A sparse semidefinite programming relaxation of polynomial optimization problems
    Waki, Hayato
    Kim, Sunyoung
    Kojima, Masakazu
    Muramatsu, Masakazu
    Sugimoto, Hiroshi
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2008, 35 (02): : 1 - 13
  • [48] Probabilistic combinatorial optimization: Moments, semidefinite programming, and asymptotic bounds
    Bertsimas, D
    Natarajan, K
    Teo, CP
    SIAM JOURNAL ON OPTIMIZATION, 2004, 15 (01) : 185 - 209
  • [49] Graph partitioning using linear and semidefinite programming
    A. Lisser
    F. Rendl
    Mathematical Programming, 2003, 95 : 91 - 101
  • [50] Relaxations of the satisfiability problem using semidefinite programming
    De Klerk, E
    Van Maaren, H
    Warners, JP
    JOURNAL OF AUTOMATED REASONING, 2000, 24 (1-2) : 37 - 65
12345