Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
From MaRDI portal
Publication:847674
DOI10.1016/j.jpaa.2009.07.003zbMath1246.11092WikidataQ114851521 ScholiaQ114851521MaRDI QIDQ847674
Publication date: 19 February 2010
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2009.07.003
semidefinite programming; noncommutative polynomials; free semialgebraic geometry; Newton chip method; sums of Hermitian squares
90C22: Semidefinite programming
11E25: Sums of squares and representations by other particular quadratic forms
08B20: Free algebras
13J30: Real algebra
Related Items
Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, On real one-sided ideals in a free algebra, A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming, The tracial moment problem and trace-optimization of polynomials, Noncommutative polynomials nonnegative on a variety intersect a convex set, On matrix algebras associated to sum-of-squares semidefinite programs, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A boundary point method to solve semidefinite programs
- Noncommutative sums of squares
- Sums of Hermitian squares and the BMV conjecture
- Extremal psd forms with few terms
- An algorithm for sums of squares of real polynomials
- On the complexity of semidefinite programs
- An exact duality theory for semidefinite programming and its complexity implications
- Semidefinite programming relaxations for semialgebraic problems
- ``Positive noncommutative polynomials are sums of squares.
- Connes' embedding conjecture and sums of Hermitian squares
- Robust Convex Optimization
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- GloptiPoly 3: moments, optimization and semidefinite programming
- Semidefinite optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- SOSTOOLS and Its Control Applications
- Regularization Methods for Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Algorithms in real algebraic geometry
