• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Genericity in Polynomial Optimization

Genericity in Polynomial Optimization

Hardcover

Series: Optimization and Its Applications, Book 3

General MathematicsGeometry

ISBN10: 1786342219
ISBN13: 9781786342218
Publisher: Wspc (Europe)
Published: Apr 15 2017
Pages: 260
Weight: 1.10
Height: 0.80 Width: 6.00 Depth: 9.10
Language: English

In full generality, minimizing a polynomial function over a closed semi-algebraic set requires complex mathematical equations. This book explains recent developments from singularity theory and semi-algebraic geometry for studying polynomial optimization problems. 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. These conditions are well known in singularity theory, however, they are rarely considered within the optimization community.

Also in

General Mathematics