Convergent relaxations of polynomial optimization problems with noncommuting variables
From MaRDI portal
Publication:3083282
Abstract: We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.
Recommendations
- SDP relaxations for non-commutative polynomial optimization
- 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
- Optimization of polynomials in non-commuting variables
Cited in
(55)- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Free extreme points span generalized free spectrahedra given by compact coefficients
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario
- Semi-definite programming and quantum information
- Matrix extreme points and free extreme points of free spectrahedra
- Entropy constraints for ground energy optimization
- The constant trace property in noncommutative optimization
- Reinhardt free spectrahedra
- A convergent inflation hierarchy for quantum causal structures
- Matrix convex hulls of free semialgebraic sets
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
- The weirdness theorem and the origin of quantum paradoxes
- A physical approach to Tsirelson's problem
- Limitations of semidefinite programs for separable states and entangled games
- Maximizing concave piecewise affine functions on the unitary group
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Information-causality and extremal tripartite correlations
- Optimization over trace polynomials
- Exploiting term sparsity in noncommutative polynomial optimization
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- Using complete measurement statistics for optimal device-independent randomness evaluation
- Can you compute the operator norm?
- On matrix algebras associated to sum-of-squares semidefinite programs
- Device-independent bit commitment based on the CHSH inequality
- Noncommutative polynomials describing convex sets
- On characterising assemblages in Einstein–Podolsky–Rosen scenarios
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Minimizer Extraction in Polynomial Optimization Is Robust
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- Randomness in post-selected events
- Lower bounds for ground states of condensed matter systems
- Quantum bilinear optimization
- Positive maps and trace polynomials from the symmetric group
- The convex Positivstellensatz in a free algebra
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- Convexity and semidefinite programming in dimension-free matrix unknowns
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Noncommutative Christoffel-Darboux kernels
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Global completability with applications to self-consistent quantum tomography
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- A paradox in bosonic energy computations via semidefinite programming relaxations
- Semidefinite programming hierarchies for constrained bilinear optimization
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- SDP relaxations for non-commutative polynomial optimization
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- A combinatorial approach to nonlocality and contextuality
- The tracial moment problem and trace-optimization of polynomials
This page was built for publication: Convergent relaxations of polynomial optimization problems with noncommuting variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083282)
