Genericity In Polynomial Optimization (Series On Optimization And Its
109,54 €
In full generality, minimizing a polynomial function over a closed semi-algebraic set requires complex mathematical equations. Classes of generic problems are defined in a simple and elegant manner by using only the two basic (and relatively simple) notions of Newton polyhedron and non-degeneracy conditions associated with a given polynomial optimization problem.
Jetzt bei Ebay:
