An introduction to polynomial and semi-algebraic optimization:
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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2015
|
| Schriftenreihe: | Cambridge texts in applied mathematics
52 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xiv, 339 pages) |
| ISBN: | 9781107447226 |
| DOI: | 10.1017/CBO9781107447226 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043940430 | ||
| 003 | DE-604 | ||
| 005 | 20180801 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9781107447226 |c Online |9 978-1-107-44722-6 | ||
| 024 | 7 | |a 10.1017/CBO9781107447226 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781107447226 | ||
| 035 | |a (OCoLC)992926537 | ||
| 035 | |a (DE-599)BVBBV043940430 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 512.9/422 |2 23 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 100 | 1 | |a Lasserre, Jean-Bernard |d 1953- |e Verfasser |0 (DE-588)121290255 |4 aut | |
| 245 | 1 | 0 | |a An introduction to polynomial and semi-algebraic optimization |c Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France |
| 246 | 1 | 3 | |a An Introduction to Polynomial & Semi-Algebraic Optimization |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2015 | |
| 300 | |a 1 online resource (xiv, 339 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge texts in applied mathematics |v 52 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a 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 | |
| 520 | |a 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 | ||
| 650 | 4 | |a Polynomials | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-06057-9 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-63069-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781107447226 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349400 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107447226 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781107447226 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176880934322176 |
|---|---|
| any_adam_object | |
| author | Lasserre, Jean-Bernard 1953- |
| author_GND | (DE-588)121290255 |
| author_facet | Lasserre, Jean-Bernard 1953- |
| author_role | aut |
| author_sort | Lasserre, Jean-Bernard 1953- |
| author_variant | j b l jbl |
| building | Verbundindex |
| bvnumber | BV043940430 |
| classification_rvk | SK 870 |
| collection | ZDB-20-CBO |
| contents | 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 |
| ctrlnum | (ZDB-20-CBO)CR9781107447226 (OCoLC)992926537 (DE-599)BVBBV043940430 |
| dewey-full | 512.9/422 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.9/422 |
| dewey-search | 512.9/422 |
| dewey-sort | 3512.9 3422 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9781107447226 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04160nmm a2200529zcb4500</leader><controlfield tag="001">BV043940430</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180801 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107447226</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-107-44722-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781107447226</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781107447226</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992926537</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940430</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.9/422</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lasserre, Jean-Bernard</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121290255</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An introduction to polynomial and semi-algebraic optimization</subfield><subfield code="c">Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">An Introduction to Polynomial & Semi-Algebraic Optimization</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 339 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge texts in applied mathematics</subfield><subfield code="v">52</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-06057-9</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-63069-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781107447226</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349400</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107447226</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781107447226</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043940430 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:13Z |
| institution | BVB |
| isbn | 9781107447226 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349400 |
| oclc_num | 992926537 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xiv, 339 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge texts in applied mathematics |
| spelling | Lasserre, Jean-Bernard 1953- Verfasser (DE-588)121290255 aut An introduction to polynomial and semi-algebraic optimization Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France An Introduction to Polynomial & Semi-Algebraic Optimization Cambridge Cambridge University Press 2015 1 online resource (xiv, 339 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge texts in applied mathematics 52 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 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 Polynomials Mathematical optimization Polynom (DE-588)4046711-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Polynom (DE-588)4046711-9 s Optimierung (DE-588)4043664-0 s 1\p DE-604 Erscheint auch als Druckausgabe 978-1-107-06057-9 Erscheint auch als Druckausgabe 978-1-107-63069-7 https://doi.org/10.1017/CBO9781107447226 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Lasserre, Jean-Bernard 1953- An introduction to polynomial and semi-algebraic optimization 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 Polynomials Mathematical optimization Polynom (DE-588)4046711-9 gnd Optimierung (DE-588)4043664-0 gnd |
| subject_GND | (DE-588)4046711-9 (DE-588)4043664-0 |
| title | An introduction to polynomial and semi-algebraic optimization |
| title_alt | An Introduction to Polynomial & Semi-Algebraic Optimization |
| title_auth | An introduction to polynomial and semi-algebraic optimization |
| title_exact_search | An introduction to polynomial and semi-algebraic optimization |
| title_full | An introduction to polynomial and semi-algebraic optimization Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France |
| title_fullStr | An introduction to polynomial and semi-algebraic optimization Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France |
| title_full_unstemmed | An introduction to polynomial and semi-algebraic optimization Jean Bernard Lasserre, LAAS-CNRS and Institut de Mathématiques, Toulouse, France |
| title_short | An introduction to polynomial and semi-algebraic optimization |
| title_sort | an introduction to polynomial and semi algebraic optimization |
| topic | Polynomials Mathematical optimization Polynom (DE-588)4046711-9 gnd Optimierung (DE-588)4043664-0 gnd |
| topic_facet | Polynomials Mathematical optimization Polynom Optimierung |
| url | https://doi.org/10.1017/CBO9781107447226 |
| work_keys_str_mv | AT lasserrejeanbernard anintroductiontopolynomialandsemialgebraicoptimization AT lasserrejeanbernard anintroductiontopolynomialsemialgebraicoptimization |