Polynomial optimization problems and their relaxations

DOI10.37070/AML.2021.38.1.07zbMATH Open1499.90149MaRDI QIDQ5065337FDOQ5065337

Dávid Papp

Publication date: 18 March 2022

Published in: Alkalmazott Matematikai Lapok (Search for Journal in Brave)

Recommendations

• Moments and sums of squares for polynomial optimization and related problems
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
• A Sum of Squares Approximation of Nonnegative Polynomials
• scientific article; zbMATH DE number 1984325
• An introduction to polynomial and semi-algebraic optimization

zbMATH Keywords

polynomial optimizationsemidefinite programmingsums-of-squarescircuit polynomials

Mathematics Subject Classification ID

Interior-point methods (90C51) Semidefinite programming (90C22) Polynomial optimization (90C23)

Cited In (14)

• Polynomial hulls and an optimization problem
• Polynomial Programming: LP-Relaxations Also Converge
• Title not available (Why is that?)
• Theory and Applications of Models of Computation
• Border basis relaxation for polynomial optimization
• Title not available (Why is that?)
• Complete solutions and extremality criteria to polynomial optimization problems
• Continuous optimization problems and a polynomial hierarchy of real functions
• Maximizing Polynomials Subject to Assignment Constraints
• Logical Approaches to Computational Barriers
• Title not available (Why is that?)
• Constrained polynomial optimization problems with noncommuting variables
• Complete solutions to a class of eighth-order polynomial optimization problems
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions

This page was built for publication: Polynomial optimization problems and their relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065337)