Multi-Degrees in Polynomial Optimization
From MaRDI portal
Abstract: We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the generic number of complex critical points. This serves as a measure for the algebraic complexity of the optimization problem. We also discuss computation and certification methods coming from numerical nonlinear algebra.
This page was built for publication: Multi-Degrees in Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411525)
