Extensions of S-lemma for noncommutative polynomial
From MaRDI portal
Publication:6972231
Cites work
- ``Positive noncommutative polynomials are sums of squares.
- A nichtnegativstellensatz for polynomials in noncommuting variables
- A positivstellensatz for non-commutative polynomials
- A Survey of the S-Lemma
- An energy amplification condition for decentralized adaptive stabilization
- Applications of convex optimization in signal processing and digital communication
- Applications of second-order cone programming
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Completely positive linear maps on complex matrices
- Computationally Related Problems
- Constrained polynomial optimization problems with noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Convex Analysis
- Convex Noncommutative Polynomials Have Degree Two or Less
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Exploiting term sparsity in noncommutative polynomial optimization
- Factorization of Noncommutative Polynomials and Nullstellensätze for the Free Algebra
- Factorization of operator-valued polynomials in several non-commuting variables
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 3368525 (Why is no real title available?)
- Joint measurability of quantum effects and the matrix diamond
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear Matrix Inequalities in System and Control Theory
- Matrix convex hulls of free semialgebraic sets
- Matrix identities of the fast Fourier transform
- Multivariate Nonnegative Quadratic Mappings
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- New Results on Quadratic Minimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Noncommutative polynomials describing convex sets
- Noncommutative sums of squares
- On a subproblem of trust region algorithms for constrained optimization
- On Cones of Nonnegative Quadratic Functions
- On the mapping of quadratic forms.
- On the S-procedure and some variants
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- Optimization of polynomials in non-commuting variables
- Quantum information theory and free semialgebraic geometry: one wonderland through two looking glasses
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Semidefinite programming relaxations for semialgebraic problems
- Sparse noncommutative polynomial optimization
- Strong majorization in a free \(*\)-algebra.
- Sums of squares, moment matrices and optimization over polynomials
- The K-moment problem for compact semi-algebraic sets
- The convex Positivstellensatz in a free algebra
- The matricial relaxation of a linear matrix inequality
- The theory of quantum information
This page was built for publication: Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972231)
