|
Books > Science & Mathematics > Mathematics > Optimization
|
Buy Now
Genericity In Polynomial Optimization (Hardcover)
Loot Price: R2,162
Discovery Miles 21 620
|
|
|
Genericity In Polynomial Optimization (Hardcover)
Series: Series On Optimization And Its Applications, 3
Expected to ship within 18 - 22 working days
|
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,
Hoelderian 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
