Minimizer Extraction in Polynomial Optimization Is Robust
DOI10.1137/17M1152061zbMath1409.90135OpenAlexW2903064578MaRDI QIDQ4561225
Igor Klep, Jurij Volčič, Janez Povh
Publication date: 5 December 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1152061
moment problemsemidefinite programmingtraceHankel matrixGNS constructionflat extensionpolynomial optimizationnoncommutative polynomialsum of squares
Semidefinite programming (90C22) Linear operator methods in interpolation, moment and extension problems (47A57) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex Positivstellensatz in a free algebra
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Noncommutative sums of squares
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- Making almost commuting matrices commute
- Almost commuting matrices
- How bad are Hankel matrices?
- Semidefinite programming relaxations for semialgebraic problems
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Positive polynomials in control.
- Connes' embedding conjecture and sums of Hermitian squares
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Optimization of Polynomials in Non-Commuting Variables
- Almost commuting self-adjoint matrices: The real and self-dual cases
- Constrained Polynomial Optimization Problems with Noncommuting Variables
- The truncated tracial moment problem
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
- Almost commuting Hermitian matrices.
- Convex Noncommutative Polynomials Have Degree Two or Less
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A positivstellensatz for non-commutative polynomials
- Solution of the truncated complex moment problem for flat data
- Semidefinite Optimization and Convex Algebraic Geometry
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Constrained trace-optimization of polynomials in freely noncommuting variables
This page was built for publication: Minimizer Extraction in Polynomial Optimization Is Robust
