论文部分内容阅读
Both polynomial and tensor optimization problems have been challenging research topics and wide range of applications.We first construct the constant ratio transformation from polynomial optimization problem to tensor optimization problem.For a wide class of tensor optimization problems,we discuss various approximation schemes with the assistance of randomized algorithms.We also discuss some recent developments on probability bounds which contribute to fast algorithms for approximation of tensor problems.