Sparse noncommutative polynomial optimization
From MaRDI portal
Publication:2144551
DOI10.1007/s10107-020-01610-1zbMath1494.90072arXiv1909.00569OpenAlexW3125912346MaRDI QIDQ2144551
Victor Magron, Igor Klep, Janez Povh
Publication date: 14 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00569
eigenvalue optimizationsemidefinite programmingsemialgebraic setGNS constructionnoncommutative polynomialsparsity patterntrace optimization
Semidefinite programming (90C22) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Complete rings, completion (13J10) Polynomial optimization (90C23)
Related Items
SONC optimization and exact nonnegativity certificates via second-order cone programming, Bilinear matrix inequalities and polynomials in several freely noncommuting variables, Exploiting term sparsity in noncommutative polynomial optimization, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, A sublevel moment-SOS hierarchy for polynomial optimization, Dimension-free entanglement detection in multipartite Werner states
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Proof of the BMV conjecture
- The convex Positivstellensatz in a free algebra
- The \(\mathcal A\)-truncated \(K\)-moment problem
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Handbook on semidefinite, conic and polynomial optimization
- Hyperbolic polynomials and generalized Clifford algebras
- Noncommutative sums of squares
- Equivalent forms of the Bessis-Moussa-Villani conjecture
- Sums of Hermitian squares and the BMV conjecture
- Extremal psd forms with few terms
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Theory of operator algebras. II
- ``Positive noncommutative polynomials are sums of squares.
- The tracial moment problem and trace-optimization of polynomials
- Exploiting term sparsity in noncommutative polynomial optimization
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Anneaux preordonnes
- A bounded degree SOS hierarchy for polynomial optimization
- A note on the representation of positive polynomials with structured sparsity
- Introduction to noncommutative algebra.
- Ordered linear spaces
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
- Optimization of Polynomials in Non-Commuting Variables
- Algorithm 950
- Constrained Polynomial Optimization Problems with Noncommuting Variables
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Certified Roundoff Error Bounds Using Semidefinite Programming
- Free Random Variables
- Newton-Type Minimization via the Lanczos Method
- Differential equations, difference equations and matrix theory
- GloptiPoly 3: moments, optimization and semidefinite programming
- Approximate Volume and Integration for Basic Semialgebraic Sets
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Linear Matrix Inequalities in System and Control Theory
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- A positivstellensatz for non-commutative polynomials
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Factorization of operator-valued polynomials in several non-commuting variables
