Approximating Norm-Constrained Polynomial Optimization Problems via the Algorithmic Theory of Convex

来源 :International Conference on the spectral theory of the tenso | 被引量 : 0次 | 上传用户:ice_city_82
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In recent years,norm-constrained polynomial optimization has found applications in many different areas,including spectral theory of tensors,signal processing,data analysis and quantum physics.Given their generality,norm-constrained polynomial optimization problems are typically intractable,which leads to the question of their approximability.In this talk,we will discuss the close connection between norm-constrained polynomial optimization and the algorithmic theory of convex bodies.Then,we will demonstrate how techniques from the latter can be used to prove the best-known-to-date approximation results for various classes of norm-constrained polynomial optimization problems.
其他文献
  This is a joint work with Chungen Liu.In this talk,we briefly review Maslov type index theory for symplectic paths with Lagrangian boundary.As a application
会议
  Let Ω be the unit ball B1(0) in Rn or be the upper half space Rn+.Assume 0
会议
  The geometric measure of entanglement for a symmetric pure state with nonnegative amplitudes has attracted much attention,and the spectral theory of nonnega
会议
  In this talk,we present some perturbation bounds for the largest eigenvalue of an mth-order n-dimensional non-negative tensor.The computable bound is also g
会议
  We propose an efficient method for solving polynomial optimization and tensor optimization problems.The new approach has the following three main ingredient
会议
  A popular approach to solve a large scale optimization problem under independent constraints is to cyclically update a subset of variables by minimizing a l
会议
  In this talk,we report some existing algorithms for computing the spectral radius of an irreducible nonnegative tensor.We establish the linear convergence o
会议
  In this talk,we analyze the backward error and perturbation bounds for the high order Sylvester tensor equation (STE).We present the bounds of the backward
会议
  Two new eigenvalue inclusion sets for tensors are established.It is proved that the new eigenvalue inclusion sets are tighter than that in [Qi L.Eigenvalues
会议
  In this talk,we show that minimizing a quartic form over a unit sphere is equivalent to minimizing a convex quadratic function over the intersection of a un
会议