Genericity In Polynomial Optimization
Series: Series On Optimization And Its Applications; 3;
- Publisher's listprice GBP 73.00
-
34 875 Ft (33 215 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 6 975 Ft off)
- Discounted price 27 901 Ft (26 572 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
34 875 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher World Scientific Publishing Europe Ltd
- Date of Publication 23 February 2017
- ISBN 9781786342218
- Binding Hardback
- No. of pages260 pages
- Language English 0
Categories
Long description:
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.
More
Creating Competent Communication with Webcom
25 941 HUF
23 866 HUF
