Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
From MaRDI portal
Publication:4637505
DOI10.1137/15M1034386zbMath1395.90196arXiv1709.04376OpenAlexW2795779869WikidataQ130011205 ScholiaQ130011205MaRDI QIDQ4637505
Cédric Josz, Daniel K. Molzahn
Publication date: 24 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.04376
semidefinite programmingoptimal power flowchordal sparsityHermitian sum-of-squaresmulti-ordered Lasserre hierarchy
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Computational aspects in algebraic geometry (14Q99) Classical measure theory (28A99)
Related Items (22)
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Global optimal power flow over large-scale power transmission networks ⋮ Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ Partial Lasserre relaxation for sparse Max-Cut ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ Sum-of-squares chordal decomposition of polynomial matrix inequalities ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Approximation algorithms for optimization of real-valued general conjugate complex forms ⋮ Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Complex orthogonal polynomials and numerical quadrature via hyponormality ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ The weirdness theorem and the origin of quantum paradoxes ⋮ A sublevel moment-SOS hierarchy for polynomial optimization ⋮ Exploiting sparsity in complex polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hermitian algebra on the ellipse
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On the truncated operator trigonometric moment problem
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Angular synchronization by eigenvectors and semidefinite programming
- Hermitian analogues of Hilbert's 17-th problem
- Approximation methods for complex polynomial optimization
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Szegő polynomials and the truncated trigonometric moment problem
- The subnormal completion problem in several variables
- Moment problems and subnormality
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A generalized flat extension theorem for moment matrices
- The \(K\)-moment problem for compact semi-algebraic sets
- Lectures on hyponormal operators
- A moment problem for positive measures on the unit disc
- The complex moment problem and subnormality: A polar decomposition approach
- Nearly subnormal operators and moment problems
- Semidefinite programming relaxations for semialgebraic problems
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Truncated trigonometric moment problems and determinate measures
- A stabilization theorem for Hermitian forms and applications to holomorphic mappings
- Structured low rank decomposition of multivariate Hankel matrices
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- Positive polynomials on fibre products
- A bounded degree SOS hierarchy for polynomial optimization
- A note on the representation of positive polynomials with structured sparsity
- On Hermitian polynomial optimization
- On the representation of hermitian forms as sums of squares
- Global Optimization with Polynomials and the Problem of Moments
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- The truncated matrix-valued $K$-moment problem on $\mathbb {R}^d$, $\mathbb {C}^d$, and $\mathbb {T}^d$
- HERMITIAN COMPLEXITY OF REAL POLYNOMIAL IDEALS
- GloptiPoly 3: moments, optimization and semidefinite programming
- Quillen property of real algebraic varieties
- Sums of squares and moment problems in equivariant situations
- Multivariate determinates
- On Joint Hyponormality of Operators
- A Note on Joint Hyponormality
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- MIMO Radar Waveform Optimization With Prior Information of the Extended Target and Clutter
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Optimisation globale et théorie des moments
- Solution of the truncated complex moment problem for flat data
- Unconstrained Optimization of Real Functions in Complex Variables
- The truncated complex $K$-moment problem
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Fast ADMM for Sum-of-Squares Programs Using Partial Orthogonality
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- Blind constant modulus equalization via convex optimization
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Phase Retrieval via Matrix Completion
- Strong duality in lasserre's hierarchy for polynomial optimization
This page was built for publication: Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
