Exploiting sparsity in complex polynomial optimization

DOI10.1007/s10957-021-01975-zzbMath1484.90071arXiv2103.12444OpenAlexW3216509523MaRDI QIDQ2073057

Victor Magron, Jie Wang

Publication date: 27 January 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.12444

zbMATH Keywords

optimal power flowcomplex polynomial optimizationcorrelative sparsitycomplex moment-HSOS hierarchyterm sparsity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10) Polynomial optimization (90C23)

Related Items (1)

A new global algorithm for max-cut problem with chordal sparsity

Uses Software

• ComputeTW
• JuMP
• GitHub
• LightGraphs.jl
• PhaseCut
• PGLib-OPF
• TSSOS
• ChordalGraph
• SparseJSR

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the sum of many rational functions
• Phase retrieval for imaging problems
• Positive definite completions of partial Hermitian matrices
• Treewidth computations. I: Upper bounds
• Positive semidefinite matrices with a given sparsity pattern
• Exploiting term sparsity in noncommutative polynomial optimization
• Global Optimization with Polynomials and the Problem of Moments
• Certified Roundoff Error Bounds Using Semidefinite Programming
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• On the complexity of purely complex μ computation and related problems in multidimensional systems
• Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
• Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• The geometric measure of multipartite entanglement and the singular values of a hypermatrix
• Blind constant modulus equalization via convex optimization
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• JuMP: A Modeling Language for Mathematical Optimization
• Mathematical programming formulations for the alternating current optimal power flow problem

This page was built for publication: Exploiting sparsity in complex polynomial optimization