Genericity In Polynomial Optimization

Pham, Tien Son (Univ Of Dalat, Vui, Ha Huy (Vietnam Academy Of Science & Technology

Omschrijving

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. Explanations focus on critical points and tangencies of polynomial optimization, Hölderian error bounds for polynomial systems, Frank-Wolfe-type theorem for polynomial programs and well-posedness in polynomial optimization. It then goes on to look at optimization for the different types of polynomials. Through this text graduate students, PhD students and researchers of mathematics will be provided with the knowledge necessary to use semi-algebraic geometry in optimization.
Gratis verzending vanaf
€ 19,95 binnen Nederland
Schrijver
Pham, Tien Son (Univ Of Dalat, Vui, Ha Huy (Vietnam Academy Of Science & Technology
Titel
Genericity In Polynomial Optimization
Uitgever
World Scientific Europe Ltd
Jaar
2017
Taal
Engels
Pagina's
262
Gewicht
499 gr
EAN
9781786342218
Afmetingen
229 x 159 x 20 mm
Bindwijze
Hardback

U ontvangt bij ons altijd de laatste druk!


Rubrieken

Boekstra