# An introduction to polynomial and semi-algebraic optimization / Jean Bernard Lasserre, LAAS-CNRS and Institut de MathÃ©matiques, Toulouse, France.

##### By: Lasserre, Jean-Bernard [author.].

Material type: TextSeries: Cambridge texts in applied mathematics.Publisher: Cambridge : Cambridge University Press, 2015Description: xiv, 339 pages : UKP 36.99 illustrations ; 24 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9781107060579 (hardback); 1107060575 (hardback); 9781107630697 (paperback); 110763069X (paperback).Subject(s): Polynomials | Mathematical optimization | MATHEMATICS / Mathematical AnalysisDDC classification: 512.9/422 Other classification: MAT034000Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|

Book | Chennai Mathematical Institute General Stacks | 512.942 LAS (Browse shelf) | Available | 10476 |

##### Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser

512.94 WIL The algebraic eigenvalue problem / | 512.942 COX Applications of polynomial systems / | 512.942 FIN The fundamental theorem of algebra / | 512.942 LAS An introduction to polynomial and semi-algebraic optimization / | 512.942 SER Lectures on Nx(p) / | 512.943 AND An introduction to random matrices / | 512.943 BHA In the Matrix Mould expository articles by Rajendra Bhatia |

Includes bibliographical references and index.

Machine generated contents note: 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 Lowner-John's problem; Appendix A. Semidefinite programming; Appendix B. The GloptiPoly software; Bibliography; Index.