Convexity and its applications in discrete and continuous optimization:
Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numb...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2025
|
| Links: | https://doi.org/10.1017/9781108946650 |
| Zusammenfassung: | Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers. |
| Umfang: | 1 Online-Ressource (xviii, 310 Seiten) |
| ISBN: | 9781108946650 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108946650 | ||
| 003 | UkCbUP | ||
| 005 | 20250206140230.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 200528s2025||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108946650 | ||
| 100 | 1 | |a Basu, Amitabh | |
| 245 | 1 | 0 | |a Convexity and its applications in discrete and continuous optimization |c Amitabh Basu, John Hopkins University |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2025 | |
| 300 | |a 1 Online-Ressource (xviii, 310 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108837590 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108946650 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108946650 |
|---|---|
| _version_ | 1825574045525999616 |
| adam_text | |
| any_adam_object | |
| author | Basu, Amitabh |
| author_facet | Basu, Amitabh |
| author_role | |
| author_sort | Basu, Amitabh |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01777nam a2200241 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108946650</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20250206140230.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">200528s2025||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108946650</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Basu, Amitabh</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convexity and its applications in discrete and continuous optimization</subfield><subfield code="c">Amitabh Basu, John Hopkins University</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2025</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xviii, 310 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108837590</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108946650</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108946650 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:57:59Z |
| institution | BVB |
| isbn | 9781108946650 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xviii, 310 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2025 |
| publishDateSearch | 2025 |
| publishDateSort | 2025 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Basu, Amitabh Convexity and its applications in discrete and continuous optimization Amitabh Basu, John Hopkins University Cambridge Cambridge University Press 2025 1 Online-Ressource (xviii, 310 Seiten) txt c cr Using a pedagogical, unified approach, this book presents both the analytic and combinatorial aspects of convexity and its applications in optimization. On the structural side, this is done via an exposition of classical convex analysis and geometry, along with polyhedral theory and geometry of numbers. On the algorithmic/optimization side, this is done by the first ever exposition of the theory of general mixed-integer convex optimization in a textbook setting. Classical continuous convex optimization and pure integer convex optimization are presented as special cases, without compromising on the depth of either of these areas. For this purpose, several new developments from the past decade are presented for the first time outside technical research articles: discrete Helly numbers, new insights into sublinear functions, and best known bounds on the information and algorithmic complexity of mixed-integer convex optimization. Pedagogical explanations and more than 300 exercises make this book ideal for students and researchers. Erscheint auch als Druck-Ausgabe 9781108837590 |
| spellingShingle | Basu, Amitabh Convexity and its applications in discrete and continuous optimization |
| title | Convexity and its applications in discrete and continuous optimization |
| title_auth | Convexity and its applications in discrete and continuous optimization |
| title_exact_search | Convexity and its applications in discrete and continuous optimization |
| title_full | Convexity and its applications in discrete and continuous optimization Amitabh Basu, John Hopkins University |
| title_fullStr | Convexity and its applications in discrete and continuous optimization Amitabh Basu, John Hopkins University |
| title_full_unstemmed | Convexity and its applications in discrete and continuous optimization Amitabh Basu, John Hopkins University |
| title_short | Convexity and its applications in discrete and continuous optimization |
| title_sort | convexity and its applications in discrete and continuous optimization |
| work_keys_str_mv | AT basuamitabh convexityanditsapplicationsindiscreteandcontinuousoptimization |