Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications

Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications

Li, Zhening
He, Simai
Zhang, Shuzhong

Paperback

Series: Springerbriefs in Optimization

General MathematicsProgramming

ISBN10: 1461439833
ISBN13: 9781461439837
Publisher: Springer
Published: Jul 24 2012
Pages: 124
Weight: 0.44
Height: 0.29 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Mathematics

View All