Sum of Squares Decompositions and Rank Bounds for Biquadratic Forms
Liqun Qi, Chunfeng Cui, Yi Xu

TL;DR
This paper investigates sum of squares decompositions for biquadratic forms, establishing conditions for positive semi-definiteness, deriving bounds on SOS rank, and providing explicit examples that demonstrate the tightness of these bounds.
Contribution
It extends SOS results to partially symmetric biquadratic forms, introduces computational procedures, and establishes tight bounds on SOS rank for various biquadratic forms.
Findings
Every PSD partially symmetric biquadratic form is a sum of squares of bilinear forms.
Explicit SOS decompositions for specific biquadratic forms are provided.
Universal upper bound SOS-rank(P) ≤ mn-1 is established and shown to be tight.
Abstract
We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic form is a sum of squares of bilinear forms. This extends the known result for fully symmetric biquadratic forms. We describe an efficient computational procedure for constructing SOS decompositions, exploiting the Kronecker-product structure of the associated matrix representation. We introduce simple biquadratic forms. For , we present a PSD biquadratic form and show that it can be expressed as the sum of squares, but cannot be expressed as the sum of squares. This provides a lower bound for sos rank of biquadratic forms, and shows that previously proved results that a PSD biquadratic form can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Tensor decomposition and applications · Advanced Optimization Algorithms Research
