An Explicit SOS Decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector

Size: px
Start display at page:

Download "An Explicit SOS Decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector"

Transcription

1 arxiv: v1 [math.oc] 8 Mar 2015 An Explicit SOS Decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector Yannan Chen Liqun Qi Qun Wang September 25, 2018 Abstract In this note, we construct explicit SOS decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector, at the critical value. This is a supplementary note to Paper [3]. Key words: Hankel tensors, generating vectors, sum of squares, positive semidefiniteness. AMS subject classifications (2010): 15A18; 15A69 We construct an explicit SOS decomposition for the homogeneous polynomial f(x). Let u := ( x 2 1,x2 2,x2 3,x2 4,x ) 1x 3,x 2 x 4,x 1 x 2,x 3 x 4,x 2 x 3,x 1 x 4, be a basis of quadratics. Then, f(x) is SOS if and only if there exists a PSD matrix C such that f(x) = u Cu. Inspired by the Cholecky decomposition of C, we define the parameterized SOS decomposition of f(x) as follows f(x) = 10 q 2 k (x), School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, China. ynchen@zzu.edu.cn (Y. Chen) This author s work was supported by the National Natural Science Foundation of China (Grant No ) and the Development Foundation for Excellent Youth Scholars of Zhengzhou University (Grant No ). Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. maqilq@polyu.edu.hk (L. Qi). This author s work was partially supported by the Hong Kong Research Grant Council (Grant No. PolyU , , and ). Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. wangqun876@gmail.com (Q. Wang). 1

2 where q 1 (x) = α 11 x 2 1 +α 12 x 2 2 +α 13 x 2 3 +α 14 x 2 4 +α 15 x 1 x 3 +α 16 x 2 x 4 +α 17 x 1 x 2 +α 18 x 3 x 4 +α 19 x 2 x 3 +α 1,10 x 1 x 4, q 2 (x) = α 22 x 2 2 +α 23x 2 3 +α 24x 2 4 +α 25x 1 x 3 +α 26 x 2 x 4 +α 27 x 1 x 2 +α 28 x 3 x 4 +α 29 x 2 x 3 +α 2,10 x 1 x 4, q 3 (x) = α 33 x 2 3 +α 34x 2 4 +α 35x 1 x 3 +α 36 x 2 x 4 +α 37 x 1 x 2 +α 38 x 3 x 4 +α 39 x 2 x 3 +α 3,10 x 1 x 4, q 4 (x) = α 44 x 2 4 +α 45x 1 x 3 +α 46 x 2 x 4 +α 47 x 1 x 2 +α 48 x 3 x 4 +α 49 x 2 x 3 +α 4,10 x 1 x 4, q 5 (x) = α 55 x 1 x 3 +α 56 x 2 x 4 +α 57 x 1 x 2 +α 58 x 3 x 4 +α 59 x 2 x 3 +α 5,10 x 1 x 4, q 6 (x) = α 66 x 2 x 4 +α 67 x 1 x 2 +α 68 x 3 x 4 +α 69 x 2 x 3 +α 6,10 x 1 x 4, q 7 (x) = α 77 x 1 x 2 +α 78 x 3 x 4 +α 79 x 2 x 3 +α 7,10 x 1 x 4, q 8 (x) = α 88 x 3 x 4 +α 89 x 2 x 3 +α 8,10 x 1 x 4, q 9 (x) = α 99 x 2 x 3 +α 9,10 x 1 x 4, q 10 (x) = α 10,10 x 1 x 4. 2

3 The involved 55 parameters α i,j,(i j), satisfies the following 35 equality constraints v 0 = α11, 2 (1) 4v 1 = 2α 11 α 17, (2) 4v 2 = 2α 11 α 15, (3) 7 6v 2 = 2α 11 α 12 + αk7, 2 (4) 4v 3 = 2α 11 α 1,10, (5) 12v 3 = 2α 11 α α k5 α k7, (6) 4v 3 = 2 α k2 α k7, (7) 12 = 2α 11 α = 2α 11 α = 2 1 = 7 α k7 α k10, (8) αk5 2, (9) α k2 α k α k7 α k9, (10) αk2 2, (11) α 11 α v 5 = 2 α k5 α k,10, (12) α k2 α k10 +2 α k3 α k7 +2 α k6 α k7, (13) α k5 α k9, (14) α k2 α k9, (15) 6v 6 = 2α 11 α v 6 = 2 4v 6 = 2 10 α k5 α k6 +2 α 2 k10, (16) 7 9 α k7 α k8 +2 α k9 α k10, (17) α k3 α k5, (18) 3

4 4v 6 = 2 6v 6 = 2 4v 5 = 2 12 = 2 6 = 2 12 = 2 1 = 4v 3 = 2 12v 3 = 2 4v 3 = 2 4v 2 = 2 6v 2 = 2 4v 1 = 2 v 0 = α k2 α k6, (19) α k2 α k3 + α k4 α k αk9 2, (20) α k3 α k10 +2 α k2 α k8 +2 α k6 α k10, (21) α k5 α k8, (22) α k6 α k9, (23) α k3 α k9, (24) α k4 α k5 +2 α k2 α k4 +2 α k3 α k α k8 α k10, (25) αk6 2, (26) 8 α k8 α k9, (27) αk3 2, (28) α k4 α k10, (29) α k4 α k9 +2 α k6 α k8, (30) α k3 α k8, (31) α k4 α k6, (32) α k3 α k αk8 2, (33) α k4 α k8, (34) α 2 k4. (35) 4

5 Giving fixed v 2,v 6,v 1,v 3,v 5, we denote M 1 (v 2,v 6,v 1,v 3,v 5 ) as the minimum of the following optimization problems: M 1 (v 2,v 6,v 1,v 3,v 5 ) := min v 0 s.t. equality constraints (1)-(35). (36) By simple algebraic derivation, we have the following theorem. Theorem 1 Supposethatthe assumptions(2) and(3)in [3]hold. Thenif v 0 M 1 (v 2,v 6,v 1,v 3,v 5 ), A is SOS and 10 f(x) = q k (x) 2. Thus, M 1 (v 2,v 6,v 1,v 3,v 5 ) M 0 (v 2,v 6,v 1,v 3,v 5 ). References [1] A.A. Ahmadi and P.A. Parrilo, A convex polynomial that is not sos-convex, Mathematical Programming 135 (2012) [2] R. Badeau and R. Boyer, Fast multilinear singular value decomposition for structured tensors, SIAM Journal on Matrix Analysis and Applications 30 (2008) [3] Y. Chen, L. Qi and Q. Wang, Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, arxiv: , March [4] G. Chesi, On the gap between positive polynomials and SOS of polynomials, IEEE Transactions on Automatic Control 52 (2007) [5] M.D. Choi and T.Y. Lam, Extremal positive semidefinite forms, Mathematische Annalen 231 (1977) [6] W. Ding, L. Qi and Y. Wei, Fast Hankel tensor-vector products and application to exponential data fitting, Numerical Linear Algebra with Applications, (2015), DOI: /nla [7] C. Fidalgo and A. Kovacec, Positive semidefinite diagonal minus tail forms are sums of squares, Mathematische Zeitschrift 269 (2011) [8] D. Hilbert, Über die Darstellung definiter Formen als Summe von Formenquadraten, Mathematical Annals, 32 (1888)

6 [9] S. Hu, G. Li, L. Qi and Y. Song, Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, Journal of Optimization Theory and Applications, 158 (2013) [10] S. Hu, G. Li and L. Qi, A tensor analogy of Yuan s alternative theorem and polynomial optimization with sign structure, Journal of Optimization Theory and Applications, (2015), DOI /s [11] J.B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization 11 (2001) [12] M. Laurent, Sums of squares, moment matrices and optimization over polynomials, Emerging Applications of Algebraic Geometry, Vol. 149 of IMA Volumes in Mathematics and its Applications, M. Putinar and S. Sullivant eds., Springer, (2009) pp [13] G. Li, L. Qi and Q. Wang, Are there sixth order three dimensional Hankel tensors?, arxiv: , November [14] G. Li, L. Qi and Y. Xu, SOS-Hankel Tensors: Theory and Application, arxiv: , October [15] J. Löfberg, YALMIP: A Toolbox for Modeling and Optimization in MATLAB, In: Proceedings of the CACSD Conference, Taipei, Taiwan, (2004). [16] Z. Luo, L. Qi and Y. Ye, Linear operators and positive semidefiniteness of symmetric tensor spaces, Science China Mathematics 58 (2015) [17] T.S. Motzkin, The arithmetic-geometric inequality, In: Inequalities, O. Shisha ed., Academic Press, New York, (1967) pp [18] J.M. Papy, L. De Lauauwer and S. Van Huffel, Exponential data fitting using multilinear algebra: The single-channel and multi-channel case, Numerical Linear Algebra with Applications 12 (2005) [19] L. Qi, Eigenvalues of a real supersymmetric tensor, Journal of Symbolic Computation 40 (2005) [20] L. Qi, Hankel tensors: Associated Hankel matrices and Vandermonde decomposition, Communications in Mathematical Sciences 13 (2015) [21] B. Reznick, Some concrete aspects of Hilbert s 17th problem, Contemporary Mathematics 253 (2000)

Are There Sixth Order Three Dimensional PNS Hankel Tensors?

Are There Sixth Order Three Dimensional PNS Hankel Tensors? Are There Sixth Order Three Dimensional PNS Hankel Tensors? Guoyin Li Liqun Qi Qun Wang November 17, 014 Abstract Are there positive semi-definite PSD) but not sums of squares SOS) Hankel tensors? If the

More information

SOS-Hankel Tensors: Theory and Application

SOS-Hankel Tensors: Theory and Application SOS-Hankel Tensors: Theory and Application Guoyin Li Liqun Qi Yi Xu arxiv:submit/1103222 [math.sp] 2 Nov 2014 November 2, 2014 Abstract Hankel tensors arise from signal processing and some other applications.

More information

An Even Order Symmetric B Tensor is Positive Definite

An Even Order Symmetric B Tensor is Positive Definite An Even Order Symmetric B Tensor is Positive Definite Liqun Qi, Yisheng Song arxiv:1404.0452v4 [math.sp] 14 May 2014 October 17, 2018 Abstract It is easily checkable if a given tensor is a B tensor, or

More information

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Shenglong Hu Guoyin Li Liqun Qi Yisheng Song September 16, 2012 Abstract Finding the maximum eigenvalue

More information

Tensor Complementarity Problem and Semi-positive Tensors

Tensor Complementarity Problem and Semi-positive Tensors DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New

More information

New Classes of Positive Semi-Definite Hankel Tensors

New Classes of Positive Semi-Definite Hankel Tensors Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,

More information

SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS

SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS HAIBIN CHEN, GUOYIN LI, AND LIQUN QI Abstract. In this paper, we examine structured tensors which have sum-of-squares (SOS) tensor decomposition, and study

More information

arxiv: v1 [math.ra] 11 Aug 2014

arxiv: v1 [math.ra] 11 Aug 2014 Double B-tensors and quasi-double B-tensors Chaoqian Li, Yaotang Li arxiv:1408.2299v1 [math.ra] 11 Aug 2014 a School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan, P. R. China 650091

More information

Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting

Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting Weiyang Ding Liqun Qi Yimin Wei arxiv:1401.6238v1 [math.na] 24 Jan 2014 January 27, 2014 Abstract This paper is contributed

More information

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS MEHDI GHASEMI AND MURRAY MARSHALL Abstract. Recently Lasserre [6] gave a sufficient condition in terms of the coefficients for a polynomial f

More information

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu

More information

Converse Results on Existence of Sum of Squares Lyapunov Functions

Converse Results on Existence of Sum of Squares Lyapunov Functions 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12-15, 2011 Converse Results on Existence of Sum of Squares Lyapunov Functions Amir

More information

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial J Glob Optim 2016) 64:563 575 DOI 10.1007/s10898-015-0343-y Eigenvalue analysis of constrained minimization problem for homogeneous polynomial Yisheng Song 1,2 Liqun Qi 2 Received: 31 May 2014 / Accepted:

More information

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING MEHDI GHASEMI AND MURRAY MARSHALL Abstract. We make use of a result of Hurwitz and Reznick [8] [19], and a consequence of this result due to Fidalgo

More information

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares Journal of Global Optimization (2005) 33: 511 525 Springer 2005 DOI 10.1007/s10898-005-2099-2 Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares JIAWANG NIE 1 and JAMES W.

More information

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th

More information

arxiv: v2 [math-ph] 3 Jun 2017

arxiv: v2 [math-ph] 3 Jun 2017 Elasticity M -tensors and the Strong Ellipticity Condition Weiyang Ding Jinjie Liu Liqun Qi Hong Yan June 6, 2017 arxiv:170509911v2 [math-ph] 3 Jun 2017 Abstract In this paper, we propose a class of tensors

More information

Block diagonalization of matrix-valued sum-of-squares programs

Block diagonalization of matrix-valued sum-of-squares programs Block diagonalization of matrix-valued sum-of-squares programs Johan Löfberg Division of Automatic Control Department of Electrical Engineering Linköpings universitet, SE-581 83 Linköping, Sweden WWW:

More information

Analytical Validation Tools for Safety Critical Systems

Analytical Validation Tools for Safety Critical Systems Analytical Validation Tools for Safety Critical Systems Peter Seiler and Gary Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA Andrew Packard

More information

Strictly nonnegative tensors and nonnegative tensor partition

Strictly nonnegative tensors and nonnegative tensor partition SCIENCE CHINA Mathematics. ARTICLES. January 2012 Vol. 55 No. 1: 1 XX doi: Strictly nonnegative tensors and nonnegative tensor partition Hu Shenglong 1, Huang Zheng-Hai 2,3, & Qi Liqun 4 1 Department of

More information

An Irreducible Function Basis of Isotropic Invariants of A Third Order Three-Dimensional Symmetric Tensor

An Irreducible Function Basis of Isotropic Invariants of A Third Order Three-Dimensional Symmetric Tensor An Irreducible Function Basis of Isotropic Invariants of A Third Order Three-Dimensional Symmetric Tensor Zhongming Chen Jinjie Liu Liqun Qi Quanshui Zheng Wennan Zou June 22, 2018 arxiv:1803.01269v2 [math-ph]

More information

D-eigenvalues of diffusion kurtosis tensors

D-eigenvalues of diffusion kurtosis tensors Journal of Computational and Applied Mathematics 221 (2008) 150 157 www.elsevier.com/locate/cam D-eigenvalues of diffusion kurtosis tensors Liqun Qi a,, Yiju Wang b, Ed X. Wu c a Department of Applied

More information

A positive definite polynomial Hessian that does not factor

A positive definite polynomial Hessian that does not factor A positive definite polynomial Hessian that does not factor The MIT Faculty has made this article openly available Please share how this access benefits you Your story matters Citation As Published Publisher

More information

UCSD Mathematics Department Tel: (858) Gilman Drive, La Jolla, CA Fax: (858)

UCSD Mathematics Department Tel: (858) Gilman Drive, La Jolla, CA Fax: (858) UCSD Mathematics Department Tel: (858)534-6015 9500 Gilman Drive, La Jolla, CA 92093 Fax: (858)534-5273 http://www.math.ucsd.edu/ njw njw@math.ucsd.edu Curriculum Vitae Jiawang Nie Research Area Education

More information

Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms

Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms BIT Numer Math (27) 57:69 9 DOI 7/s543-6-622- Inheritance properties and sum-of-squares decomposition of Hankel tensors: theory and algorithms Weiyang Ding Liqun Qi 2 Yimin Wei 3 Received: 5 May 25 / Accepted:

More information

R, 1 i 1,i 2,...,i m n.

R, 1 i 1,i 2,...,i m n. SIAM J. MATRIX ANAL. APPL. Vol. 31 No. 3 pp. 1090 1099 c 2009 Society for Industrial and Applied Mathematics FINDING THE LARGEST EIGENVALUE OF A NONNEGATIVE TENSOR MICHAEL NG LIQUN QI AND GUANGLU ZHOU

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms. Author(s)

More information

Formulating an n-person noncooperative game as a tensor complementarity problem

Formulating an n-person noncooperative game as a tensor complementarity problem arxiv:60203280v [mathoc] 0 Feb 206 Formulating an n-person noncooperative game as a tensor complementarity problem Zheng-Hai Huang Liqun Qi February 0, 206 Abstract In this paper, we consider a class of

More information

arxiv: v1 [math.oc] 6 Mar 2009

arxiv: v1 [math.oc] 6 Mar 2009 A convex polynomial that is not sos-convex Amir Ali Ahmadi and Pablo A. Parrilo arxiv:090.87v1 [math.oc] 6 Mar 2009 Abstract A multivariate polynomial p(x) = p(x 1,...,x n ) is sos-convex if its Hessian

More information

Properties of Solution Set of Tensor Complementarity Problem

Properties of Solution Set of Tensor Complementarity Problem Properties of Solution Set of Tensor Complementarity Problem arxiv:1508.00069v3 [math.oc] 14 Jan 2017 Yisheng Song Gaohang Yu Abstract The tensor complementarity problem is a specially structured nonlinear

More information

Conditions for Strong Ellipticity of Anisotropic Elastic Materials

Conditions for Strong Ellipticity of Anisotropic Elastic Materials J Elast (009 97: 1 13 DOI 10.1007/s10659-009-905-5 Conditions for Strong Ellipticity of Anisotropic Elastic Materials Deren Han H.H. Dai Liqun Qi Received: 5 August 007 / Published online: 0 May 009 Springer

More information

Circulant Tensors with Applications to Spectral Hypergraph Theory and Stochastic Process

Circulant Tensors with Applications to Spectral Hypergraph Theory and Stochastic Process Circulant Tensors with Applications to Spectral Hypergraph Theory and Stochastic Process arxiv:1312.2752v8 [math.sp] 26 Nov 2014 Zhongming Chen, Liqun Qi November 27, 2014 Abstract Circulant tensors naturally

More information

On Polynomial Optimization over Non-compact Semi-algebraic Sets

On Polynomial Optimization over Non-compact Semi-algebraic Sets On Polynomial Optimization over Non-compact Semi-algebraic Sets V. Jeyakumar, J.B. Lasserre and G. Li Revised Version: April 3, 2014 Communicated by Lionel Thibault Abstract The optimal value of a polynomial

More information

A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor

A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2007; 00:1 6 [Version: 2002/09/18 v1.02] A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric

More information

Spectral directed hypergraph theory via tensors

Spectral directed hypergraph theory via tensors Linear and Multilinear Algebra ISSN: 0308-1087 (Print) 1563-5139 (Online) Journal homepage: http://www.tandfonline.com/loi/glma20 Spectral directed hypergraph theory via tensors Jinshan Xie & Liqun Qi

More information

Representations of Positive Polynomials: Theory, Practice, and

Representations of Positive Polynomials: Theory, Practice, and Representations of Positive Polynomials: Theory, Practice, and Applications Dept. of Mathematics and Computer Science Emory University, Atlanta, GA Currently: National Science Foundation Temple University

More information

Permutation transformations of tensors with an application

Permutation transformations of tensors with an application DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn

More information

Polynomial complementarity problems

Polynomial complementarity problems Polynomial complementarity problems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA gowda@umbc.edu December 2, 2016

More information

UCSD Mathematics Department Tel: (858) Gilman Drive, La Jolla, CA Fax: (858)

UCSD Mathematics Department Tel: (858) Gilman Drive, La Jolla, CA Fax: (858) UCSD Mathematics Department Tel: (858)534-6015 9500 Gilman Drive, La Jolla, CA 92093 Fax: (858)534-5273 http://www.math.ucsd.edu/ njw njw@math.ucsd.edu Curriculum Vitae Jiawang Nie Research Areas Education

More information

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING

LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING LOWER BOUNDS FOR POLYNOMIALS USING GEOMETRIC PROGRAMMING MEHDI GHASEMI AND MURRAY MARSHALL Abstract. We make use of a result of Hurwitz and Reznick [9] [21], and a consequence of this result due to Fidalgo

More information

arxiv:math/ v1 [math.ag] 10 Jun 2003

arxiv:math/ v1 [math.ag] 10 Jun 2003 arxiv:math/0306163v1 [math.ag] 10 Jun 2003 ON THE ABSENCE OF UNIFORM DENOMINATORS IN HILBERT S 17TH PROBLEM BRUCE REZNICK Abstract. Hilbert showedthat formost(n,m) thereexist psdformsp(x 1,...,x n ) of

More information

Ranks of Real Symmetric Tensors

Ranks of Real Symmetric Tensors Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like

More information

Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing

Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing Etienne de lerk Monique Laurent March 2, 2017 Abstract We consider the problem of minimizing

More information

REGULARLY DECOMPOSABLE TENSORS AND CLASSICAL SPIN STATES

REGULARLY DECOMPOSABLE TENSORS AND CLASSICAL SPIN STATES COMMUN MATH SCI Vol 15, No 6, pp 1651 1665 c 2017 International Press REGULARLY DECOMPOSABLE TENSORS AND CLASSICAL SPIN STATES LIQUN QI, GUOFENG ZHANG, DANIEL BRAUN, FABIAN BOHNET-WALDRAFF, AND OLIVIER

More information

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation

More information

Z-eigenvalue methods for a global polynomial optimization problem

Z-eigenvalue methods for a global polynomial optimization problem Math. Program., Ser. A (2009) 118:301 316 DOI 10.1007/s10107-007-0193-6 FULL LENGTH PAPER Z-eigenvalue methods for a global polynomial optimization problem Liqun Qi Fei Wang Yiju Wang Received: 6 June

More information

Croatian Operational Research Review (CRORR), Vol. 3, 2012

Croatian Operational Research Review (CRORR), Vol. 3, 2012 126 127 128 129 130 131 132 133 REFERENCES [BM03] S. Burer and R.D.C. Monteiro (2003), A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming

More information

A Note on KKT Points of Homogeneous Programs 1

A Note on KKT Points of Homogeneous Programs 1 A Note on KKT Points of Homogeneous Programs 1 Y. B. Zhao 2 and D. Li 3 Abstract. Homogeneous programming is an important class of optimization problems. The purpose of this note is to give a truly equivalent

More information

Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry

Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization

More information

An explicit construction of distinguished representations of polynomials nonnegative over finite sets

An explicit construction of distinguished representations of polynomials nonnegative over finite sets An explicit construction of distinguished representations of polynomials nonnegative over finite sets Pablo A. Parrilo Automatic Control Laboratory Swiss Federal Institute of Technology Physikstrasse 3

More information

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional

More information

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and

More information

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following

More information

c 2004 Society for Industrial and Applied Mathematics

c 2004 Society for Industrial and Applied Mathematics SIAM J. OPTIM. Vol. 15, No. 1, pp. 275 302 c 2004 Society for Industrial and Applied Mathematics GLOBAL MINIMIZATION OF NORMAL QUARTIC POLYNOMIALS BASED ON GLOBAL DESCENT DIRECTIONS LIQUN QI, ZHONG WAN,

More information

IEEE Transactions on Automatic Control, 2013, v. 58 n. 6, p

IEEE Transactions on Automatic Control, 2013, v. 58 n. 6, p Title Sufficient and Necessary LMI Conditions for Robust Stability of Rationally Time-Varying Uncertain Systems Author(s) Chesi, G Citation IEEE Transactions on Automatic Control, 2013, v. 58 n. 6, p.

More information

Semidefinite programming lifts and sparse sums-of-squares

Semidefinite programming lifts and sparse sums-of-squares 1/15 Semidefinite programming lifts and sparse sums-of-squares Hamza Fawzi (MIT, LIDS) Joint work with James Saunderson (UW) and Pablo Parrilo (MIT) Cornell ORIE, October 2015 Linear optimization 2/15

More information

Newcriteria for H-tensors and an application

Newcriteria for H-tensors and an application Wang and Sun Journal of Inequalities and Applications (016) 016:96 DOI 10.1186/s13660-016-1041-0 R E S E A R C H Open Access Newcriteria for H-tensors and an application Feng Wang * and De-shu Sun * Correspondence:

More information

Optimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE

Optimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE Optimization over Nonnegative Polynomials: Algorithms and Applications Amir Ali Ahmadi Princeton, ORFE INFORMS Optimization Society Conference (Tutorial Talk) Princeton University March 17, 2016 1 Optimization

More information

The maximal stable set problem : Copositive programming and Semidefinite Relaxations

The maximal stable set problem : Copositive programming and Semidefinite Relaxations The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu

More information

A semismooth Newton method for tensor eigenvalue complementarity problem

A semismooth Newton method for tensor eigenvalue complementarity problem Comput Optim Appl DOI 10.1007/s10589-016-9838-9 A semismooth Newton method for tensor eigenvalue complementarity problem Zhongming Chen 1 Liqun Qi 2 Received: 5 December 2015 Springer Science+Business

More information

Strange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization

Strange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization CS-08-02 Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization Hayato Waki, Maho Nakata, and Masakazu Muramatsu Department of Computer Science,

More information

How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization

How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications

More information

Pre- and Post-processing Sum-of-squares Programs in Practice

Pre- and Post-processing Sum-of-squares Programs in Practice IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL X, NO X, JANUARY 00X Pre- and Post-processing Sum-of-squares Programs in Practice Johan Löfberg Abstract Checking non-negativity of polynomials using sum-ofsquares

More information

Formulas for the Drazin Inverse of Matrices over Skew Fields

Formulas for the Drazin Inverse of Matrices over Skew Fields Filomat 30:12 2016 3377 3388 DOI 102298/FIL1612377S Published by Faculty of Sciences and Mathematics University of Niš Serbia Available at: http://wwwpmfniacrs/filomat Formulas for the Drazin Inverse of

More information

The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph

The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph arxiv:1303.4048v3 [math.sp] 24 Mar 2013 Shenglong Hu, Liqun Qi April 1, 2015 Abstract In this paper, we

More information

The Measure of Diffusion Skewness and Kurtosis in Magnetic Resonance Imaging

The Measure of Diffusion Skewness and Kurtosis in Magnetic Resonance Imaging The Measure of Diffusion Skewness and Kurtosis in Magnetic Resonance Imaging Xinzhen Zhang, Chen Ling, Liqun Qi, and Ed Xuekui Wu April 19, 008, Revised on September 4, 008 This paper is dedicated to the

More information

The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph

The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph arxiv:1304.1315v6 [math.sp] 11 May 2013 Shenglong Hu, Liqun Qi, Jinshan Xie May 14, 2013 Abstract In this paper, we show

More information

Computing Extreme Eigenvalues of Large Scale Hankel

Computing Extreme Eigenvalues of Large Scale Hankel J Sci Comput (2016) 68:716 738 DOI 10.1007/s10915-015-0155-8 Computing Extreme Eigenvalues of Large Scale Hankel Tensors Yannan Chen 1 Liqun Qi 2 Qun Wang 2 Received: 10 May 2015 / Revised: 8 November

More information

Eigenvalues and invariants of tensors

Eigenvalues and invariants of tensors J. Math. Anal. Appl. 325 (2007) 1363 1377 www.elsevier.com/locate/jmaa Eigenvalues and invariants of tensors Liqun Q Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong

More information

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,

More information

Optimization over Polynomials with Sums of Squares and Moment Matrices

Optimization over Polynomials with Sums of Squares and Moment Matrices Optimization over Polynomials with Sums of Squares and Moment Matrices Monique Laurent Centrum Wiskunde & Informatica (CWI), Amsterdam and University of Tilburg Positivity, Valuations and Quadratic Forms

More information

Solving Fractional Polynomial Problems by Polynomial Optimization Theory

Solving Fractional Polynomial Problems by Polynomial Optimization Theory 1 arxiv:186722v1 [csit] 19 Jun 218 Solving Fractional Polynomial Problems by Polynomial Optimization Theory Andrea Pizzo, Student Member, IEEE, Alessio Zappone, Senior Member, IEEE, Luca Sanguinetti, Senior

More information

arxiv:math/ v2 [math.oc] 25 May 2004

arxiv:math/ v2 [math.oc] 25 May 2004 arxiv:math/0304104v2 [math.oc] 25 May 2004 THE LAX CONJECTURE IS TRUE A.S. Lewis, P.A. Parrilo, and M.V. Ramana Key words: hyperbolic polynomial, Lax conjecture, hyperbolicity cone, semidefinite representable

More information

On a decomposition of multivariable forms via LMI methods

On a decomposition of multivariable forms via LMI methods Proceedings of the American Control Conference Chicago, Illinois June 2000 On a decomposition of multivariable forms via LMI methods Pablo A. Parriilo pabloqcds. caltech. edu Control & Dynamical Systems

More information

Robust and Optimal Control, Spring 2015

Robust and Optimal Control, Spring 2015 Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) G. Sum of Squares (SOS) G.1 SOS Program: SOS/PSD and SDP G.2 Duality, valid ineqalities and Cone G.3 Feasibility/Optimization

More information

VICTORIA POWERS AND THORSTEN W ORMANN Suppose there exists a real, symmetric, psd matrix B such that f = x B x T and rank t. Since B is real symmetric

VICTORIA POWERS AND THORSTEN W ORMANN Suppose there exists a real, symmetric, psd matrix B such that f = x B x T and rank t. Since B is real symmetric AN ALGORITHM FOR SUMS OF SQUARES OF REAL POLYNOMIALS Victoria Powers and Thorsten Wormann Introduction We present an algorithm to determine if a real polynomial is a sum of squares (of polynomials), and

More information

A successive approximation method for quantum separability

A successive approximation method for quantum separability Front. Math. China 2013, 8(6): 1275 1293 DOI 10.1007/s11464-013-0274-1 A successive approximation method for quantum separability Deren HAN 1, Liqun QI 2 1 School of Mathematical Sciences, Jiangsu Key

More information

Singular Value and Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices

Singular Value and Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 8 2017 Singular Value Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices Aliaa Burqan Zarqa University,

More information

Strong duality in Lasserre s hierarchy for polynomial optimization

Strong duality in Lasserre s hierarchy for polynomial optimization Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization

More information

Lecture 6 Verification of Hybrid Systems

Lecture 6 Verification of Hybrid Systems Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive

More information

Inverse Perron values and connectivity of a uniform hypergraph

Inverse Perron values and connectivity of a uniform hypergraph Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou

More information

Globally convergent algorithms for PARAFAC with semi-definite programming

Globally convergent algorithms for PARAFAC with semi-definite programming Globally convergent algorithms for PARAFAC with semi-definite programming Lek-Heng Lim 6th ERCIM Workshop on Matrix Computations and Statistics Copenhagen, Denmark April 1 3, 2005 Thanks: Vin de Silva,

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1110.0918ec e-companion ONLY AVAILABLE IN ELECTRONIC FORM informs 2011 INFORMS Electronic Companion Mixed Zero-One Linear Programs Under Objective Uncertainty: A Completely

More information

Semidefinite representation of convex hulls of rational varieties

Semidefinite representation of convex hulls of rational varieties Semidefinite representation of convex hulls of rational varieties Didier Henrion 1,2 June 1, 2011 Abstract Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares

More information

Sum of Squares Relaxations for Polynomial Semi-definite Programming

Sum of Squares Relaxations for Polynomial Semi-definite Programming Sum of Squares Relaxations for Polynomial Semi-definite Programming C.W.J. Hol, C.W. Scherer Delft University of Technology, Delft Center of Systems and Control (DCSC) Mekelweg 2, 2628CD Delft, The Netherlands

More information

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009 LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix

More information

Graph and Controller Design for Disturbance Attenuation in Consensus Networks

Graph and Controller Design for Disturbance Attenuation in Consensus Networks 203 3th International Conference on Control, Automation and Systems (ICCAS 203) Oct. 20-23, 203 in Kimdaejung Convention Center, Gwangju, Korea Graph and Controller Design for Disturbance Attenuation in

More information

arxiv: v1 [math.gr] 10 Nov 2014

arxiv: v1 [math.gr] 10 Nov 2014 arxiv:1411.2488v1 [math.gr] 10 Nov 2014 Kazhdan s Property (T) via semidefinite optimization Tim Netzer and Andreas Thom Abstract. Following an idea of Ozawa, we give a new proof of Kazhdan s property

More information

On the convergence of normal forms for analytic control systems

On the convergence of normal forms for analytic control systems Chapter 1 On the convergence of normal forms for analytic control systems Wei Kang Department of Mathematics, Naval Postgraduate School Monterey, CA 93943 wkang@nps.navy.mil Arthur J. Krener Department

More information

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this

More information

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES olume 10 2009, Issue 2, Article 41, 10 pp. ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG, AND HUA SHAO COLLEGE OF MATHEMATICS AND PHYSICS CHONGQING UNIERSITY

More information

Singular Value Inequalities for Real and Imaginary Parts of Matrices

Singular Value Inequalities for Real and Imaginary Parts of Matrices Filomat 3:1 16, 63 69 DOI 1.98/FIL16163C Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Singular Value Inequalities for Real Imaginary

More information

The number of singular vector tuples and approximation of symmetric tensors / 13

The number of singular vector tuples and approximation of symmetric tensors / 13 The number of singular vector tuples and approximation of symmetric tensors Shmuel Friedland Univ. Illinois at Chicago Colloquium NYU Courant May 12, 2014 Joint results with Giorgio Ottaviani and Margaret

More information

arxiv: v1 [math.oc] 3 Jan 2019

arxiv: v1 [math.oc] 3 Jan 2019 arxiv:1901.0069v1 [math.oc] Jan 2019 Calculating Entanglement Eigenvalues for Non-Symmetric Quantum Pure States Based on the Jacobian Semidefinite Programming Relaxation Method Mengshi Zhang a, Xinzhen

More information

Dimension reduction for semidefinite programming

Dimension reduction for semidefinite programming 1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology

More information

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG College of Mathematics and Physics Chongqing University Chongqing, 400030, P.R. China EMail: lihy.hy@gmail.com,

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Approximation Methods for Inhomogeneous Polynomial Optimization

Approximation Methods for Inhomogeneous Polynomial Optimization Approximation Methods for Inhomogeneous Polynomial Optimization Simai HE Zhening LI Shuzhong ZHANG June 29, 20 Abstract In this paper, we consider computational methods for optimizing a multivariate inhomogeneous

More information

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite

More information

A new criterion and a special class of k-positive maps

A new criterion and a special class of k-positive maps A new criterion and a special class of k-positive maps Dedicated to Professor Leiba Rodman. Jinchuan Hou Department of Mathematics, Taiyuan University of Technology, Taiyuan, 030024, China. jinchuanhou@aliyun.com

More information