Genericity In Polynomial Optimization(1st Edition)

Authors:

Ha Huy Vui

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 2 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $75.00 Savings: $75 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Genericity In Polynomial Optimization

Price:

$9.99

/month

Book details

ISBN: B0789TBXPP

Book publisher: WSPC

Offer Just for You!: Buy 2 books before the end of January and enter our lucky draw.

Book Price $0 : 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.