Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Pablo A. Parrilo / rank | |||
Property / author | |||
Property / author: Pablo A. Parrilo / rank | |||
Normal rank | |||
Property / review text | |||
The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\). | |||
Property / review text: The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Karl-Heinz Waldmann / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52B12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52B55 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6656094 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semidefinite programming | |||
Property / zbMATH Keywords: semidefinite programming / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099419577 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1503.01207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Positive semidefinite matrices with a given sparsity pattern / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4790110 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small extended formulations for cyclic polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sums of squares on the hypercube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Positive trigonometric polynomials and signal processing applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Positive semidefinite rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivariant Semidefinite Lifts of Regular Polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5511980 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Positive definite completions of partial Hermitian matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of convex decompositions of partially separable functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing Extended Formulations from Reflection Relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4496025 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5890171 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4256626 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lectures on Polytopes / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:35, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sparse sums of squares on finite abelian groups and improved semidefinite lifts |
scientific article |
Statements
Sparse sums of squares on finite abelian groups and improved semidefinite lifts (English)
0 references
25 November 2016
0 references
The paper is concerned with nonnegative functions on a finite abelian group \(G\) that are sparse with respect to the Fourier basis. The authors establish combinatorial conditions on subsets \(\mathcal{S}\) and \(\mathcal{T}\) of Fourier basis elements under which nonnegative functions with Fourier support \(\mathcal{S}\) are sums of squares of functions with Fourier support \(\mathcal{T}\). Their combinatorial condition involves constructing a chordal cover of a graph related to \(G\) and \(\mathcal{S}\) (Cayley graph Cay(\(\widehat{G},\mathcal{S}\))) with maximal cliques related to \(\mathcal{T}\). Their result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of \(G\). They apply their main result to two important special cases, namely \(G=\mathbb{Z}^n_2\) (the Boolean hypercube) and \(G=\mathbb{Z}_N\).
0 references
semidefinite programming
0 references
0 references