Algorithm 950
Published in ACM Transactions on Mathematical Software • Jun 1, 2015
NobleIDNI6P51W13R44S14
Authors:
Peter Wittek
Abstract
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 dev...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!