Algorithm 950

A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. We develop an implementation for problems of noncommuting variables that creates the relaxation to be solved by SDPA--a high-performance solver that runs in a distributed environment. We further exploit the inherent sparsity of optimization problems in quantum physics to reduce the complexity of the resulting relaxations. Constrained problems with a relaxation of order two may contain up to a hundred variables. The implementation is available in Python. The tool helps solve such as finding the ground state energy or testing quantum correlations.

[1]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[2]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[3]  Didier Henrion,et al.  GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi , 2003, TOMS.

[4]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[5]  Jaka Cimpric,et al.  A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming , 2009, 0906.2214.

[6]  M. B. Plenio,et al.  A paradox in bosonic energy computations via semidefinite programming relaxations , 2012, 1203.3777.

[7]  J. Lasserre,et al.  Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .

[8]  JoynerDavid,et al.  Open source computer algebra systems , 2012 .

[9]  Stefano Pironio,et al.  Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables , 2009, SIAM J. Optim..

[10]  Anton van den Hengel,et al.  Semidefinite Programming , 2014, Computer Vision, A Reference Guide.

[11]  Masakazu Kojima,et al.  SDPARA: SemiDefinite Programming Algorithm paRAllel version , 2003, Parallel Comput..

[12]  David Joyner,et al.  Open source computer algebra systems: SymPy , 2012, ACCA.

[13]  A. Acín,et al.  A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations , 2008, 0803.4290.

[14]  Didier Henrion,et al.  GloptiPoly 3: moments, optimization and semidefinite programming , 2007, Optim. Methods Softw..

[15]  Stefano Pironio,et al.  SDP Relaxations for Non-Commutative Polynomial Optimization , 2012 .

[16]  Igor Klep,et al.  NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials , 2011, Optim. Methods Softw..

[17]  Satoshi Matsuoka,et al.  High-performance general solver for extremely large-scale semidefinite programming problems , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.