Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Introduction to polynomial and semi-algebraic optimization / Jean Bernard Lasserre.

By: Material type: TextTextSeries: Cambridge texts in applied mathematicsPublication details: Cambridge : Cambridge University Press, 2015.Description: xiv, 339 p. : illustrations ; 24 cmISBN:
  • 9781107630697 (paperback)
Subject(s): DDC classification:
  • 512.9422 23 L347
Contents:
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 -- 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. Polynomial optimization as 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 Lowner-John's problem -- Appendix A. Semidefinite programming -- Appendix B. The GloptiPoly software -- Bibliography -- Index.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references and index.

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 --
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. Polynomial optimization as 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 Lowner-John's problem --
Appendix A. Semidefinite programming --
Appendix B. The GloptiPoly software --
Bibliography --
Index.

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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in