Screen LibraryGenericity in polynomial optimization /
"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 a...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Group Author: | |
| Published: |
World Scientific Publishing Europe Ltd.,
|
| Publisher Address: | London : |
| Publication Dates: | 2017. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Series on optimization and its applications ; v. 3
|
| Subjects: | |
| Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/q0066#t=toc |
| Summary: |
"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 wi |
| Item Description: | Title from PDF file title page (viewed December 27, 2016). |
| Carrier Form: | 1 online resource (261 pages). |
| Bibliography: | Includes bibliographical references (pages 231-238) and index. |
| ISBN: | 9781786342225 (ebook) |
| Index Number: | QA402 |
| CLC: | O224 |