Undergraduate convexity: from Fourier and Motzkin to Kuhn and Tucker
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
[Hackensack] New Jersey
World Scientific
[2013]
|
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Description based on print version record |
| Beschreibung: | 1 online resource (xiv, 283 pages) illustrations |
| ISBN: | 1299556337 9781299556331 9789814412513 9789814412520 9789814412537 9789814452762 9814412511 981441252X 9814412538 9814452769 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043036547 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151120s2013 |||| o||u| ||||||eng d | ||
| 015 | |a GBB308987 |2 dnb | ||
| 020 | |a 1299556337 |c electronic bk. |9 1-299-55633-7 | ||
| 020 | |a 9781299556331 |c electronic bk. |9 978-1-299-55633-1 | ||
| 020 | |a 9789814412513 |9 978-981-4412-51-3 | ||
| 020 | |a 9789814412520 |c electronic bk. |9 978-981-4412-52-0 | ||
| 020 | |a 9789814412537 |c electronic bk. |9 978-981-4412-53-7 | ||
| 020 | |a 9789814452762 |c pbk. |9 978-981-4452-76-2 | ||
| 020 | |a 9814412511 |9 981-4412-51-1 | ||
| 020 | |a 981441252X |c electronic bk. |9 981-4412-52-X | ||
| 020 | |a 9814412538 |c electronic bk. |9 981-4412-53-8 | ||
| 020 | |a 9814452769 |c pbk. |9 981-4452-76-9 | ||
| 035 | |a (OCoLC)843871633 | ||
| 035 | |a (DE-599)BVBBV043036547 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 515.8 |2 23 | |
| 100 | 1 | |a Lauritzen, Niels |d 1964- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Undergraduate convexity |b from Fourier and Motzkin to Kuhn and Tucker |c Niels Lauritzen |
| 264 | 1 | |a [Hackensack] New Jersey |b World Scientific |c [2013] | |
| 264 | 4 | |c © 2013 | |
| 300 | |a 1 online resource (xiv, 283 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on print version record | ||
| 505 | 8 | |a Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm--Page [4] of cover | |
| 505 | 8 | |a 1. Fourier-Motzkin elimination. 1.1. Linear inequalities. 1.2. Linear optimization using elimination. 1.3. Polyhedra. 1.4. Exercises -- 2. Affine subspaces. 2.1. Definition and basics. 2.2. The affine hull. 2.3. Affine subspaces and subspaces. 2.4. Affine independence and the dimension of a subset. 2.5. Exercises -- 3. Convex subsets. 3.1. Basics. 3.2. The convex hull. 3.3. Faces of convex subsets. 3.4. Convex cones. 3.5. Carathéodory's theorem. 3.6. The convex hull, simplicial subsets and Bland's rule. 3.7. Exercises -- 4. Polyhedra. 4.1. Faces of polyhedra. 4.2. Extreme points and linear optimization. 4.3. Weyl's theorem. 4.4. Farkas's lemma. 4.5. Three applications of Farkas's lemma. 4.6. Minkowski's theorem. 4.7. Parametrization of polyhedra. 4.8. Doubly stochastic matrices: the Birkhoff polytope. 4.9. Exercises -- | |
| 505 | 8 | |a 5. Computations with polyhedra. 5.1. Extreme rays and minimal generators in convex cones. 5.2. Minimal generators of a polyhedral cone. 5.3. The double description method. 5.4. Linear programming and the simplex algorithm. 5.5. Exercises -- 6. Closed convex subsets and separating hyperplanes. 6.1. Closed convex subsets. 6.2. Supporting hyperplanes. 6.3. Separation by hyperplanes. 6.4. Exercises. 7. Convex functions. 7.1. Basics. 7.2. Jensen's inequality. 7.3. Minima of convex functions. 7.4. Convex functions of one variable. 7.5. Differentiable functions of one variable. 7.6. Taylor polynomials. 7.7. Differentiable convex functions. 7.8. Exercises -- 8. Differentiable functions of several variables. 8.1. Differentiability. 8.2. The chain rule. 8.3. Lagrange multipliers. 8.4. The arithmetic-geometric inequality revisited. 8.5. Exercises -- | |
| 505 | 8 | |a 9. Convex functions of several variables. 9.1. Subgradients. 9.2. Convexity and the Hessian. 9.3. Positive definite and positive semidefinite matrices. 9.4. Principal minors and definite matrices. 9.5. The positive semidefinite cone. 9.6. Reduction of symmetric matrices. 9.7. The spectral theorem. 9.8. Quadratic forms. 9.9. Exercises -- 10. Convex optimization. 10.1. A geometric optimality criterion. 10.2. The Karush-Kuhn-Tucker conditions. 10.3. An example. 10.4. The Langrangian, saddle points, duality and game theory. 10.5. An interior point method. 10.6. Maximizing convex functions over polytopes. 10.7. Exercises | |
| 650 | 7 | |a MATHEMATICS / Calculus |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Mathematical Analysis |2 bisacsh | |
| 650 | 4 | |a Convex functions | |
| 650 | 4 | |a Convex domains | |
| 650 | 0 | 7 | |a Konvexe Funktion |0 (DE-588)4139679-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Konvexität |0 (DE-588)4114284-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Konvexe Menge |0 (DE-588)4165212-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Konvexität |0 (DE-588)4114284-6 |D s |
| 689 | 0 | 1 | |a Konvexe Menge |0 (DE-588)4165212-5 |D s |
| 689 | 0 | 2 | |a Konvexe Funktion |0 (DE-588)4139679-0 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Lauritzen, Niels, 1964- |t Undergraduate convexity |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028461195 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175397178310656 |
|---|---|
| any_adam_object | |
| author | Lauritzen, Niels 1964- |
| author_facet | Lauritzen, Niels 1964- |
| author_role | aut |
| author_sort | Lauritzen, Niels 1964- |
| author_variant | n l nl |
| building | Verbundindex |
| bvnumber | BV043036547 |
| collection | ZDB-4-EBA |
| contents | Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm--Page [4] of cover 1. Fourier-Motzkin elimination. 1.1. Linear inequalities. 1.2. Linear optimization using elimination. 1.3. Polyhedra. 1.4. Exercises -- 2. Affine subspaces. 2.1. Definition and basics. 2.2. The affine hull. 2.3. Affine subspaces and subspaces. 2.4. Affine independence and the dimension of a subset. 2.5. Exercises -- 3. Convex subsets. 3.1. Basics. 3.2. The convex hull. 3.3. Faces of convex subsets. 3.4. Convex cones. 3.5. Carathéodory's theorem. 3.6. The convex hull, simplicial subsets and Bland's rule. 3.7. Exercises -- 4. Polyhedra. 4.1. Faces of polyhedra. 4.2. Extreme points and linear optimization. 4.3. Weyl's theorem. 4.4. Farkas's lemma. 4.5. Three applications of Farkas's lemma. 4.6. Minkowski's theorem. 4.7. Parametrization of polyhedra. 4.8. Doubly stochastic matrices: the Birkhoff polytope. 4.9. Exercises -- 5. Computations with polyhedra. 5.1. Extreme rays and minimal generators in convex cones. 5.2. Minimal generators of a polyhedral cone. 5.3. The double description method. 5.4. Linear programming and the simplex algorithm. 5.5. Exercises -- 6. Closed convex subsets and separating hyperplanes. 6.1. Closed convex subsets. 6.2. Supporting hyperplanes. 6.3. Separation by hyperplanes. 6.4. Exercises. 7. Convex functions. 7.1. Basics. 7.2. Jensen's inequality. 7.3. Minima of convex functions. 7.4. Convex functions of one variable. 7.5. Differentiable functions of one variable. 7.6. Taylor polynomials. 7.7. Differentiable convex functions. 7.8. Exercises -- 8. Differentiable functions of several variables. 8.1. Differentiability. 8.2. The chain rule. 8.3. Lagrange multipliers. 8.4. The arithmetic-geometric inequality revisited. 8.5. Exercises -- 9. Convex functions of several variables. 9.1. Subgradients. 9.2. Convexity and the Hessian. 9.3. Positive definite and positive semidefinite matrices. 9.4. Principal minors and definite matrices. 9.5. The positive semidefinite cone. 9.6. Reduction of symmetric matrices. 9.7. The spectral theorem. 9.8. Quadratic forms. 9.9. Exercises -- 10. Convex optimization. 10.1. A geometric optimality criterion. 10.2. The Karush-Kuhn-Tucker conditions. 10.3. An example. 10.4. The Langrangian, saddle points, duality and game theory. 10.5. An interior point method. 10.6. Maximizing convex functions over polytopes. 10.7. Exercises |
| ctrlnum | (OCoLC)843871633 (DE-599)BVBBV043036547 |
| dewey-full | 515.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 515 - Analysis |
| dewey-raw | 515.8 |
| dewey-search | 515.8 |
| dewey-sort | 3515.8 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05826nmm a2200685zc 4500</leader><controlfield tag="001">BV043036547</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151120s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB308987</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299556337</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-299-55633-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299556331</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-299-55633-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814412513</subfield><subfield code="9">978-981-4412-51-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814412520</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-4412-52-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814412537</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-4412-53-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814452762</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-981-4452-76-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814412511</subfield><subfield code="9">981-4412-51-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981441252X</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">981-4412-52-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814412538</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">981-4412-53-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814452769</subfield><subfield code="c">pbk.</subfield><subfield code="9">981-4452-76-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)843871633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043036547</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-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">515.8</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lauritzen, Niels</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Undergraduate convexity</subfield><subfield code="b">from Fourier and Motzkin to Kuhn and Tucker</subfield><subfield code="c">Niels Lauritzen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Hackensack] New Jersey</subfield><subfield code="b">World Scientific</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 283 pages)</subfield><subfield code="b">illustrations</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="500" ind1=" " ind2=" "><subfield code="a">Description based on print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm--Page [4] of cover</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1. Fourier-Motzkin elimination. 1.1. Linear inequalities. 1.2. Linear optimization using elimination. 1.3. Polyhedra. 1.4. Exercises -- 2. Affine subspaces. 2.1. Definition and basics. 2.2. The affine hull. 2.3. Affine subspaces and subspaces. 2.4. Affine independence and the dimension of a subset. 2.5. Exercises -- 3. Convex subsets. 3.1. Basics. 3.2. The convex hull. 3.3. Faces of convex subsets. 3.4. Convex cones. 3.5. Carathéodory's theorem. 3.6. The convex hull, simplicial subsets and Bland's rule. 3.7. Exercises -- 4. Polyhedra. 4.1. Faces of polyhedra. 4.2. Extreme points and linear optimization. 4.3. Weyl's theorem. 4.4. Farkas's lemma. 4.5. Three applications of Farkas's lemma. 4.6. Minkowski's theorem. 4.7. Parametrization of polyhedra. 4.8. Doubly stochastic matrices: the Birkhoff polytope. 4.9. Exercises -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">5. Computations with polyhedra. 5.1. Extreme rays and minimal generators in convex cones. 5.2. Minimal generators of a polyhedral cone. 5.3. The double description method. 5.4. Linear programming and the simplex algorithm. 5.5. Exercises -- 6. Closed convex subsets and separating hyperplanes. 6.1. Closed convex subsets. 6.2. Supporting hyperplanes. 6.3. Separation by hyperplanes. 6.4. Exercises. 7. Convex functions. 7.1. Basics. 7.2. Jensen's inequality. 7.3. Minima of convex functions. 7.4. Convex functions of one variable. 7.5. Differentiable functions of one variable. 7.6. Taylor polynomials. 7.7. Differentiable convex functions. 7.8. Exercises -- 8. Differentiable functions of several variables. 8.1. Differentiability. 8.2. The chain rule. 8.3. Lagrange multipliers. 8.4. The arithmetic-geometric inequality revisited. 8.5. Exercises -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">9. Convex functions of several variables. 9.1. Subgradients. 9.2. Convexity and the Hessian. 9.3. Positive definite and positive semidefinite matrices. 9.4. Principal minors and definite matrices. 9.5. The positive semidefinite cone. 9.6. Reduction of symmetric matrices. 9.7. The spectral theorem. 9.8. Quadratic forms. 9.9. Exercises -- 10. Convex optimization. 10.1. A geometric optimality criterion. 10.2. The Karush-Kuhn-Tucker conditions. 10.3. An example. 10.4. The Langrangian, saddle points, duality and game theory. 10.5. An interior point method. 10.6. Maximizing convex functions over polytopes. 10.7. Exercises</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Calculus</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Mathematical Analysis</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convex functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convex domains</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexe Funktion</subfield><subfield code="0">(DE-588)4139679-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexität</subfield><subfield code="0">(DE-588)4114284-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexe Menge</subfield><subfield code="0">(DE-588)4165212-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Konvexität</subfield><subfield code="0">(DE-588)4114284-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Konvexe Menge</subfield><subfield code="0">(DE-588)4165212-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Konvexe Funktion</subfield><subfield code="0">(DE-588)4139679-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\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">Druck-Ausgabe</subfield><subfield code="a">Lauritzen, Niels, 1964-</subfield><subfield code="t">Undergraduate convexity</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028461195</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="883" ind1="1" ind2=" "><subfield code="8">2\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">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV043036547 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:15:38Z |
| institution | BVB |
| isbn | 1299556337 9781299556331 9789814412513 9789814412520 9789814412537 9789814452762 9814412511 981441252X 9814412538 9814452769 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028461195 |
| oclc_num | 843871633 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 online resource (xiv, 283 pages) illustrations |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | World Scientific |
| record_format | marc |
| spelling | Lauritzen, Niels 1964- Verfasser aut Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker Niels Lauritzen [Hackensack] New Jersey World Scientific [2013] © 2013 1 online resource (xiv, 283 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Description based on print version record Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm--Page [4] of cover 1. Fourier-Motzkin elimination. 1.1. Linear inequalities. 1.2. Linear optimization using elimination. 1.3. Polyhedra. 1.4. Exercises -- 2. Affine subspaces. 2.1. Definition and basics. 2.2. The affine hull. 2.3. Affine subspaces and subspaces. 2.4. Affine independence and the dimension of a subset. 2.5. Exercises -- 3. Convex subsets. 3.1. Basics. 3.2. The convex hull. 3.3. Faces of convex subsets. 3.4. Convex cones. 3.5. Carathéodory's theorem. 3.6. The convex hull, simplicial subsets and Bland's rule. 3.7. Exercises -- 4. Polyhedra. 4.1. Faces of polyhedra. 4.2. Extreme points and linear optimization. 4.3. Weyl's theorem. 4.4. Farkas's lemma. 4.5. Three applications of Farkas's lemma. 4.6. Minkowski's theorem. 4.7. Parametrization of polyhedra. 4.8. Doubly stochastic matrices: the Birkhoff polytope. 4.9. Exercises -- 5. Computations with polyhedra. 5.1. Extreme rays and minimal generators in convex cones. 5.2. Minimal generators of a polyhedral cone. 5.3. The double description method. 5.4. Linear programming and the simplex algorithm. 5.5. Exercises -- 6. Closed convex subsets and separating hyperplanes. 6.1. Closed convex subsets. 6.2. Supporting hyperplanes. 6.3. Separation by hyperplanes. 6.4. Exercises. 7. Convex functions. 7.1. Basics. 7.2. Jensen's inequality. 7.3. Minima of convex functions. 7.4. Convex functions of one variable. 7.5. Differentiable functions of one variable. 7.6. Taylor polynomials. 7.7. Differentiable convex functions. 7.8. Exercises -- 8. Differentiable functions of several variables. 8.1. Differentiability. 8.2. The chain rule. 8.3. Lagrange multipliers. 8.4. The arithmetic-geometric inequality revisited. 8.5. Exercises -- 9. Convex functions of several variables. 9.1. Subgradients. 9.2. Convexity and the Hessian. 9.3. Positive definite and positive semidefinite matrices. 9.4. Principal minors and definite matrices. 9.5. The positive semidefinite cone. 9.6. Reduction of symmetric matrices. 9.7. The spectral theorem. 9.8. Quadratic forms. 9.9. Exercises -- 10. Convex optimization. 10.1. A geometric optimality criterion. 10.2. The Karush-Kuhn-Tucker conditions. 10.3. An example. 10.4. The Langrangian, saddle points, duality and game theory. 10.5. An interior point method. 10.6. Maximizing convex functions over polytopes. 10.7. Exercises MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Convex functions Convex domains Konvexe Funktion (DE-588)4139679-0 gnd rswk-swf Konvexität (DE-588)4114284-6 gnd rswk-swf Konvexe Menge (DE-588)4165212-5 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Konvexität (DE-588)4114284-6 s Konvexe Menge (DE-588)4165212-5 s Konvexe Funktion (DE-588)4139679-0 s 2\p DE-604 Erscheint auch als Druck-Ausgabe Lauritzen, Niels, 1964- Undergraduate convexity http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Lauritzen, Niels 1964- Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm--Page [4] of cover 1. Fourier-Motzkin elimination. 1.1. Linear inequalities. 1.2. Linear optimization using elimination. 1.3. Polyhedra. 1.4. Exercises -- 2. Affine subspaces. 2.1. Definition and basics. 2.2. The affine hull. 2.3. Affine subspaces and subspaces. 2.4. Affine independence and the dimension of a subset. 2.5. Exercises -- 3. Convex subsets. 3.1. Basics. 3.2. The convex hull. 3.3. Faces of convex subsets. 3.4. Convex cones. 3.5. Carathéodory's theorem. 3.6. The convex hull, simplicial subsets and Bland's rule. 3.7. Exercises -- 4. Polyhedra. 4.1. Faces of polyhedra. 4.2. Extreme points and linear optimization. 4.3. Weyl's theorem. 4.4. Farkas's lemma. 4.5. Three applications of Farkas's lemma. 4.6. Minkowski's theorem. 4.7. Parametrization of polyhedra. 4.8. Doubly stochastic matrices: the Birkhoff polytope. 4.9. Exercises -- 5. Computations with polyhedra. 5.1. Extreme rays and minimal generators in convex cones. 5.2. Minimal generators of a polyhedral cone. 5.3. The double description method. 5.4. Linear programming and the simplex algorithm. 5.5. Exercises -- 6. Closed convex subsets and separating hyperplanes. 6.1. Closed convex subsets. 6.2. Supporting hyperplanes. 6.3. Separation by hyperplanes. 6.4. Exercises. 7. Convex functions. 7.1. Basics. 7.2. Jensen's inequality. 7.3. Minima of convex functions. 7.4. Convex functions of one variable. 7.5. Differentiable functions of one variable. 7.6. Taylor polynomials. 7.7. Differentiable convex functions. 7.8. Exercises -- 8. Differentiable functions of several variables. 8.1. Differentiability. 8.2. The chain rule. 8.3. Lagrange multipliers. 8.4. The arithmetic-geometric inequality revisited. 8.5. Exercises -- 9. Convex functions of several variables. 9.1. Subgradients. 9.2. Convexity and the Hessian. 9.3. Positive definite and positive semidefinite matrices. 9.4. Principal minors and definite matrices. 9.5. The positive semidefinite cone. 9.6. Reduction of symmetric matrices. 9.7. The spectral theorem. 9.8. Quadratic forms. 9.9. Exercises -- 10. Convex optimization. 10.1. A geometric optimality criterion. 10.2. The Karush-Kuhn-Tucker conditions. 10.3. An example. 10.4. The Langrangian, saddle points, duality and game theory. 10.5. An interior point method. 10.6. Maximizing convex functions over polytopes. 10.7. Exercises MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Convex functions Convex domains Konvexe Funktion (DE-588)4139679-0 gnd Konvexität (DE-588)4114284-6 gnd Konvexe Menge (DE-588)4165212-5 gnd |
| subject_GND | (DE-588)4139679-0 (DE-588)4114284-6 (DE-588)4165212-5 (DE-588)4123623-3 |
| title | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker |
| title_auth | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker |
| title_exact_search | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker |
| title_full | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker Niels Lauritzen |
| title_fullStr | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker Niels Lauritzen |
| title_full_unstemmed | Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker Niels Lauritzen |
| title_short | Undergraduate convexity |
| title_sort | undergraduate convexity from fourier and motzkin to kuhn and tucker |
| title_sub | from Fourier and Motzkin to Kuhn and Tucker |
| topic | MATHEMATICS / Calculus bisacsh MATHEMATICS / Mathematical Analysis bisacsh Convex functions Convex domains Konvexe Funktion (DE-588)4139679-0 gnd Konvexität (DE-588)4114284-6 gnd Konvexe Menge (DE-588)4165212-5 gnd |
| topic_facet | MATHEMATICS / Calculus MATHEMATICS / Mathematical Analysis Convex functions Convex domains Konvexe Funktion Konvexität Konvexe Menge Lehrbuch |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=575386 |
| work_keys_str_mv | AT lauritzenniels undergraduateconvexityfromfourierandmotzkintokuhnandtucker |