Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

An Introduction to Polynomial and Semi-Algebraic Optimization

$48.00 ( ) USD

Part of Cambridge Texts in Applied Mathematics

  • Date Published: January 2015
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9781316236611

$ 48.00 USD ( )
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Other available formats:
Paperback, Hardback


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

    • The first textbook entirely devoted to this hot topic in optimization and computer science
    • Demonstrates the power and versatility of the new moment approach
    • Introduces new powerful algebraic techniques that have potential uses in many other fields and applications
    Read more

    Reviews & endorsements

    "This monograph may be considered as a comprehensive introduction to solving global optimization problems described by polynomials and even semi-algebraic functions. The book is accompanied by a Matlab freeware software that implements the described methodology … The well written and extensive introduction may help the reader to knowingly use the book."
    Jerzy Ombach, Zentralblatt MATH

    'This book provides an accessible introduction to very recent developments in the field of polynomial optimisation, i.e., the task of finding the infimum of a polynomial function on a set defined by polynomial constraints … Every chapter contains additional exercises and a guide to the (free) Matlab software GloptiPoly. Therefore, this really well-written book provides an ideal introduction for individual learning and is well suited as the basis for a course on polynomical optimisation. Cordian Riener, Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 2015
    • format: Adobe eBook Reader
    • isbn: 9781316236611
    • contains: 15 b/w illus. 2 colour illus.
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    Preface
    List of symbols
    1. Introduction and messages of the book
    Part I. Positive Polynomials and Moment Problems:
    2. Positive polynomials and moment problems
    3. Another look at nonnegativity
    4. The cone of polynomials nonnegative on K
    Part II. Polynomial and Semi-algebraic Optimization:
    5. The primal and dual points of view
    6. Semidefinite relaxations for polynomial optimization
    7. Global optimality certificates
    8. Exploiting sparsity or symmetry
    9. LP relaxations for polynomial optimization
    10. Minimization of rational functions
    11. Semidefinite relaxations for semi-algebraic optimization
    12. An eigenvalue problem
    Part III. Specializations and Extensions:
    13. Convexity in polynomial optimization
    14. Parametric optimization
    15. Convex underestimators of polynomials
    16. Inverse polynomial optimization
    17. Approximation of sets defined with quantifiers
    18. Level sets and a generalization of the Löwner-John's problem
    Appendix A. Semidefinite programming
    Appendix B. The GloptiPoly software
    References
    Index.

  • Author

    Jean Bernard Lasserre, Centre National de la Recherche Scientifique (CNRS), Toulouse
    Jean Bernard Lasserre is Directeur de Recherche at the LAAS laboratory in Toulouse and a member of the Institute of Mathematics of Toulouse (IMT). In 2009 he received the Lagrange Prize, awarded jointly by the Mathematical Optimization Society (MOS) and the Society for Industrial and Applied Mathematics (SIAM). He is the winner of the 2015 INFORMS Optimization Society Khachiyan Prize, awarded for life-time achievements in the area of optimization.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×