Some advances in tensor analysis and polynomial optimization

Zhening Li, Chen Ling, Yiju Wang, Qingzhi Yang

Research output: Contribution to journalArticlepeer-review

94 Downloads (Pure)

Abstract

Tensor analysis (also called as numerical multilinear algebra) mainly includes tensor decomposition, tensor eigenvalue theory and relevant algorithms. Polynomial optimization mainly includes theory and algorithms for solving optimization problems with polynomial objects functions under polynomial constrains. This survey covers the most of recent advances in these two fields. For tensor analysis, we introduce some properties and algorithms concerning the spectral radius of nonnegative tensors' H-eigenvalue. We also discuss the optimization models and solution methods of nonnegative tensors' largest (smallest) Z-eigenvalue. For polynomial optimization problems, we mainly introduce the optimization of homogeneous polynomial function under the unit spherical constraints or binary constraints and their extended problems, and semidefinite relaxation methods for solving them approximately. We also look into the further perspective of these research topics.
Original languageEnglish
Pages (from-to)134-148
JournalOperations Research Transactions
Volume18
Issue number1
Early online date14 Mar 2014
Publication statusPublished - Mar 2014

Keywords

  • tensor
  • eigenvalue
  • spectral radius
  • polynomial optimization
  • algorithm
  • semidefinite relaxation
  • approximation algorithm

Fingerprint

Dive into the research topics of 'Some advances in tensor analysis and polynomial optimization'. Together they form a unique fingerprint.

Cite this