Basics of optimization theory:
This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cham, Switzerland
Springer
[2023]
|
Schriftenreihe: | Synthesis lectures on mathematics & statistics
Synthesis collection of technology |
Schlagworte: | |
Zusammenfassung: | This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized objective. A quick perusal of the Fibonacci search algorithm provides a simple and tantalizing first encounter with optimization theory, and a review of the max-min exposition of one-dimensional calculus prepares readers for the more sophisticated topics found later in the book. Notable features are the innovative perspectives on the simplex algorithm and Karush-Kuhn-Tucker-John conditions as well as a wealth of helpful diagrams. The author provides pointers to references for readers who would like to learn more about rigorous definitions, proofs, elegant reformulations and extensions, and case studies. However, the book is sufficiently self-contained to serve as a reliable resource for readers who wish to exploit commercially available optimization software without investing the time to develop expertise in its aspects.This book also: - Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory- Features plentiful resources that focus on rigorous definitions, proofs, and case studies |
Beschreibung: | A Preliminary Note.- Fibonnacci Search.- Linear Programming.- Nonlinear Programming in One Dimension.- Nonlinear Multidimensional Optimization.- Constrained Optimization |
Beschreibung: | viii, 143 Seiten Illustrationen, Diagramme 443 gr |
ISBN: | 9783031292187 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV049495606 | ||
003 | DE-604 | ||
005 | 20240208 | ||
007 | t | ||
008 | 240110s2023 a||| |||| 00||| eng d | ||
020 | |a 9783031292187 |c hbk |9 978-3-031-29218-7 | ||
024 | 3 | |a 9783031292187 | |
035 | |a (OCoLC)1420416349 | ||
035 | |a (DE-599)BVBBV049495606 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Snider, Arthur David |d 1940- |e Verfasser |0 (DE-588)153940824 |4 aut | |
245 | 1 | 0 | |a Basics of optimization theory |c Arthur David Snide |
264 | 1 | |a Cham, Switzerland |b Springer |c [2023] | |
300 | |a viii, 143 Seiten |b Illustrationen, Diagramme |c 443 gr | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Synthesis lectures on mathematics & statistics | |
490 | 0 | |a Synthesis collection of technology | |
500 | |a A Preliminary Note.- Fibonnacci Search.- Linear Programming.- Nonlinear Programming in One Dimension.- Nonlinear Multidimensional Optimization.- Constrained Optimization | ||
520 | |a This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized objective. A quick perusal of the Fibonacci search algorithm provides a simple and tantalizing first encounter with optimization theory, and a review of the max-min exposition of one-dimensional calculus prepares readers for the more sophisticated topics found later in the book. Notable features are the innovative perspectives on the simplex algorithm and Karush-Kuhn-Tucker-John conditions as well as a wealth of helpful diagrams. The author provides pointers to references for readers who would like to learn more about rigorous definitions, proofs, elegant reformulations and extensions, and case studies. However, the book is sufficiently self-contained to serve as a reliable resource for readers who wish to exploit commercially available optimization software without investing the time to develop expertise in its aspects.This book also: - Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory- Features plentiful resources that focus on rigorous definitions, proofs, and case studies | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Mathematics | |
650 | 4 | |a Mathematics—Data processing | |
650 | 4 | |a Computer science—Mathematics | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Mathematical optimization | |
653 | |a Hardcover, Softcover / Mathematik/Sonstiges | ||
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-031-29219-4 |
999 | |a oai:aleph.bib-bvb.de:BVB01-034840836 |
Datensatz im Suchindex
_version_ | 1804186298087374848 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Snider, Arthur David 1940- |
author_GND | (DE-588)153940824 |
author_facet | Snider, Arthur David 1940- |
author_role | aut |
author_sort | Snider, Arthur David 1940- |
author_variant | a d s ad ads |
building | Verbundindex |
bvnumber | BV049495606 |
ctrlnum | (OCoLC)1420416349 (DE-599)BVBBV049495606 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02984nam a2200409 c 4500</leader><controlfield tag="001">BV049495606</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240208 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240110s2023 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031292187</subfield><subfield code="c">hbk</subfield><subfield code="9">978-3-031-29218-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783031292187</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1420416349</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049495606</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Snider, Arthur David</subfield><subfield code="d">1940-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)153940824</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Basics of optimization theory</subfield><subfield code="c">Arthur David Snide</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham, Switzerland</subfield><subfield code="b">Springer</subfield><subfield code="c">[2023]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">viii, 143 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">443 gr</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Synthesis lectures on mathematics & statistics</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Synthesis collection of technology</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">A Preliminary Note.- Fibonnacci Search.- Linear Programming.- Nonlinear Programming in One Dimension.- Nonlinear Multidimensional Optimization.- Constrained Optimization</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized objective. A quick perusal of the Fibonacci search algorithm provides a simple and tantalizing first encounter with optimization theory, and a review of the max-min exposition of one-dimensional calculus prepares readers for the more sophisticated topics found later in the book. Notable features are the innovative perspectives on the simplex algorithm and Karush-Kuhn-Tucker-John conditions as well as a wealth of helpful diagrams. The author provides pointers to references for readers who would like to learn more about rigorous definitions, proofs, elegant reformulations and extensions, and case studies. However, the book is sufficiently self-contained to serve as a reliable resource for readers who wish to exploit commercially available optimization software without investing the time to develop expertise in its aspects.This book also: - Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory- Features plentiful resources that focus on rigorous definitions, proofs, and case studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics—Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hardcover, Softcover / Mathematik/Sonstiges</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-031-29219-4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034840836</subfield></datafield></record></collection> |
id | DE-604.BV049495606 |
illustrated | Illustrated |
index_date | 2024-07-03T23:20:23Z |
indexdate | 2024-07-10T10:08:54Z |
institution | BVB |
isbn | 9783031292187 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034840836 |
oclc_num | 1420416349 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | viii, 143 Seiten Illustrationen, Diagramme 443 gr |
publishDate | 2023 |
publishDateSearch | 2023 |
publishDateSort | 2023 |
publisher | Springer |
record_format | marc |
series2 | Synthesis lectures on mathematics & statistics Synthesis collection of technology |
spelling | Snider, Arthur David 1940- Verfasser (DE-588)153940824 aut Basics of optimization theory Arthur David Snide Cham, Switzerland Springer [2023] viii, 143 Seiten Illustrationen, Diagramme 443 gr txt rdacontent n rdamedia nc rdacarrier Synthesis lectures on mathematics & statistics Synthesis collection of technology A Preliminary Note.- Fibonnacci Search.- Linear Programming.- Nonlinear Programming in One Dimension.- Nonlinear Multidimensional Optimization.- Constrained Optimization This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized objective. A quick perusal of the Fibonacci search algorithm provides a simple and tantalizing first encounter with optimization theory, and a review of the max-min exposition of one-dimensional calculus prepares readers for the more sophisticated topics found later in the book. Notable features are the innovative perspectives on the simplex algorithm and Karush-Kuhn-Tucker-John conditions as well as a wealth of helpful diagrams. The author provides pointers to references for readers who would like to learn more about rigorous definitions, proofs, elegant reformulations and extensions, and case studies. However, the book is sufficiently self-contained to serve as a reliable resource for readers who wish to exploit commercially available optimization software without investing the time to develop expertise in its aspects.This book also: - Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory- Features plentiful resources that focus on rigorous definitions, proofs, and case studies Mathematics Mathematics—Data processing Computer science—Mathematics Algorithms Mathematical optimization Hardcover, Softcover / Mathematik/Sonstiges Erscheint auch als Online-Ausgabe 978-3-031-29219-4 |
spellingShingle | Snider, Arthur David 1940- Basics of optimization theory Mathematics Mathematics—Data processing Computer science—Mathematics Algorithms Mathematical optimization |
title | Basics of optimization theory |
title_auth | Basics of optimization theory |
title_exact_search | Basics of optimization theory |
title_exact_search_txtP | Basics of optimization theory |
title_full | Basics of optimization theory Arthur David Snide |
title_fullStr | Basics of optimization theory Arthur David Snide |
title_full_unstemmed | Basics of optimization theory Arthur David Snide |
title_short | Basics of optimization theory |
title_sort | basics of optimization theory |
topic | Mathematics Mathematics—Data processing Computer science—Mathematics Algorithms Mathematical optimization |
topic_facet | Mathematics Mathematics—Data processing Computer science—Mathematics Algorithms Mathematical optimization |
work_keys_str_mv | AT sniderarthurdavid basicsofoptimizationtheory |