SDP relaxations for non-commutative polynomial optimization
From MaRDI portal
Publication:2802540
DOI10.1007/978-1-4614-0769-0_21zbMATH Open1334.90113OpenAlexW251229954MaRDI QIDQ2802540FDOQ2802540
Authors: Miguel Navascués, Stefano Pironio, A. Acín 
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_21
Recommendations
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Optimization of polynomials in non-commuting variables
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
Applications of mathematical programming (90C90) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- On rings of operators. Reduction theory
- An introduction to commutative and noncommutative Gröbner bases
- Global optimization with polynomials and the problem of moments
- ON MUTUALLY UNBIASED BASES
- Semidefinite programming relaxations for semialgebraic problems
- Speakable and unspeakable in quantum mechanics
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- A strict Positivstellensatz for the Weyl algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- ``Positive noncommutative polynomials are sums of squares.
- A positivstellensatz for non-commutative polynomials
- Solution of the truncated complex moment problem for flat data
- A glance beyond the quantum model
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Connes' embedding problem and Tsirelson's problem
- Symmetries of the Bell correlation inequalities
- Unique games with entangled provers are easy
- Non-negative hereditary polynomials in a free \(*\)-algebra
- On the positivstellensatz in Weyl’s algebra
- A nichtnegativstellensatz for polynomials in noncommuting variables
- Large-scale semidefinite programs in electronic structure calculation
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Maximal sets of mutually unbiased quantum states in dimension 6
- Testing the dimension of Hilbert spaces
- Free probability theory. Papers from a workshop on random matrices and operator algebra free products, Toronto, Canada, Mars 1995
- Unbounded induced representations of \(\ast \)-algebras
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
Cited In (16)
- Dual bounds for the positive definite functions approach to mutually unbiased bases
- The tracial moment problem and trace-optimization of polynomials
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- RepLAB: A Computational/Numerical Approach to Representation Theory
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- The moment-SOS hierarchy: applications and related topics
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns
- Exploiting term sparsity in noncommutative polynomial optimization
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Constrained polynomial optimization problems with noncommuting variables
- A synchronous NPA hierarchy with applications
- A paradox in bosonic energy computations via semidefinite programming relaxations
Uses Software
This page was built for publication: SDP relaxations for non-commutative polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802540)
