The tracial moment problem and trace-optimization of polynomials
From MaRDI portal
Publication:1942272
DOI10.1007/s10107-011-0505-8zbMath1274.90256OpenAlexW2064609151MaRDI QIDQ1942272
Janez Povh, Kristijan Cafuta, Sabine Burgdorf, Igor Klep
Publication date: 18 March 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0505-8
Real algebraic geometrySemi-definite programmingSum of squaresFlat extensionFree positivityNon-commutative polynomialTracial moment problem
Semidefinite programming (90C22) Linear operator methods in interpolation, moment and extension problems (47A57) Free algebras (08B20) Real algebra (13J30)
Related Items
Noncommutative Christoffel-Darboux kernels, Sparse noncommutative polynomial optimization, Quantum Bilinear Optimization, Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, The strong truncated Hamburger moment problem with and without gaps, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, Exploiting term sparsity in noncommutative polynomial optimization, The singular bivariate quartic tracial moment problem, Real zero polynomials and A. Horn's problem, The tracial moment problem on quadratic varieties, Constrained trace-optimization of polynomials in freely noncommuting variables, Tracial moment problems on hypercubes, Optimization over trace polynomials, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- Sums of Hermitian squares and the BMV conjecture
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- An exact duality theory for semidefinite programming and its complexity implications
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- Efficient decomposition of separable algebras.
- ``Positive noncommutative polynomials are sums of squares.
- Connes' embedding conjecture and sums of Hermitian squares
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
- Solving the truncated moment problem solves the full moment problem
- The truncated tracial moment problem
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- GloptiPoly 3: moments, optimization and semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- SOSTOOLS and Its Control Applications
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Solution of the truncated complex moment problem for flat data
- Regularization Methods for Semidefinite Programming
- The proof of Tchakaloff’s Theorem
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Factorization of operator-valued polynomials in several non-commuting variables
