NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
From MaRDI portal
Publication:3093048
DOI10.1080/10556788.2010.544312zbMath1226.90063MaRDI QIDQ3093048
Igor Klep, Janez Povh, Kristijan Cafuta
Publication date: 12 October 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.544312
90C22: Semidefinite programming
90C90: Applications of mathematical programming
11E25: Sums of squares and representations by other particular quadratic forms
08B20: Free algebras
13J30: Real algebra
90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming
Related Items
NCSOStools, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, On real one-sided ideals in a free algebra, The convex Positivstellensatz in a free algebra, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, The tracial moment problem and trace-optimization of polynomials
Uses Software
Cites Work
- Unnamed Item
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- A boundary point method to solve semidefinite programs
- Noncommutative sums of squares
- Advances on the Bessis-Moussa-Villani trace conjecture
- Equivalent forms of the Bessis-Moussa-Villani conjecture
- Sums of Hermitian squares and the BMV conjecture
- An algorithm for sums of squares of real polynomials
- Matrix inequalities: A symbolic procedure to determine convexity automatically
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- ``Positive noncommutative polynomials are sums of squares.
- Computing sum of squares decompositions with rational coefficients
- Connes' embedding conjecture and sums of Hermitian squares
- Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- GloptiPoly 3: moments, optimization and semidefinite programming
- Semidefinite optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Convex Noncommutative Polynomials Have Degree Two or Less
- 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
- Regularization Methods for Semidefinite Programming
- Factorization of operator-valued polynomials in several non-commuting variables
