Polynomial optimization problems and their relaxations

DOI10.37070/AML.2021.38.1.07MaRDI QIDQ5065337zbMATH OpenFDO

Authors Dávid Papp

Publication date 18 March 2022

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

Full work available at URL https://doi.org/10.37070/AML.2021.38.1.07

zbMATH Keywords

circuit polynomialspolynomial optimizationsemidefinite programmingsums-of-squares

Mathematics Subject Classification ID

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

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

Cited in

(23)

• Continuous optimization problems and a polynomial hierarchy of real functions
• Polynomial hulls and an optimization problem
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions
• Complete solutions and extremality criteria to polynomial optimization problems
• Positivity and optimization: beyond polynomials
• Constrained polynomial optimization problems with noncommuting variables
• An introduction to polynomial and semi-algebraic optimization
• Maximizing Polynomials Subject to Assignment Constraints
• scientific article; zbMATH DE number 3843508 (Why is no real title available?)
• scientific article; zbMATH DE number 557207 (Why is no real title available?)
• Sampling algebraic varieties for sum of squares programs
• Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
• Complete solutions to a class of eighth-order polynomial optimization problems
• An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
• Polynomial Programming: LP-Relaxations Also Converge
• scientific article; zbMATH DE number 2232767 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• Theory and Applications of Models of Computation
• Signomial and polynomial optimization via relative entropy and partial dualization
• 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
• Border basis relaxation for polynomial optimization

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)