Skip to main content
  • Book
  • © 2012

Approximation Methods for Polynomial Optimization

Models, Algorithms, and Applications

  • Discuss some important subclasses of polynomial optimization models arising from various applications
  • Focuses on approximations algorithms with guaranteed worst case performance analysis
  • Presents a clear view of the basic ideas underlying the design of algorithms and the benefits are highlighted by illustrative examples showing the possible applications
  • Includes supplementary material: sn.pub/extras

Part of the book series: SpringerBriefs in Optimization (BRIEFSOPTI)

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (5 chapters)

  1. Front Matter

    Pages i-viii
  2. Introduction

    • Zhening Li, Simai He, Shuzhong Zhang
    Pages 1-22
  3. Polynomial Optimization Over the Euclidean Ball

    • Zhening Li, Simai He, Shuzhong Zhang
    Pages 23-51
  4. Extensions of the Constraint Sets

    • Zhening Li, Simai He, Shuzhong Zhang
    Pages 53-97
  5. Applications

    • Zhening Li, Simai He, Shuzhong Zhang
    Pages 99-111
  6. Concluding Remarks

    • Zhening Li, Simai He, Shuzhong Zhang
    Pages 113-117
  7. Back Matter

    Pages 119-124

About this book

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications.

 

This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.

Reviews

From the reviews:

“The book is an outgrowth of the first author’s Ph.D. thesis, defended in 2011 … . It is a well-written timely collection of state-of-the-art approximation algorithms for polynomial optimization problems … . All of the approximation results of the book are conveniently summarized and listed in table 5.1 for quick reference, with a unified nomenclature introduced in sections 1.3.1 and 1.3.2.” (Didier Henrion, Mathematical Reviews, March, 2013)

Authors and Affiliations

  • , Mathematics, Shanghai University, Shanghai, China, People's Republic

    Zhening Li

  • , Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong SAR

    Simai He

  • , Industrial & Systems Engineering, University of Minnesota, Minneapolis, USA

    Shuzhong Zhang

Bibliographic Information

Buy it now

Buying options

eBook USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access