Mathematical Theory of Optimization:
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Boston, MA
Springer US
2001
|
Schriftenreihe: | Nonconvex Optimization and Its Applications
56 |
Schlagwörter: | |
Links: | https://doi.org/10.1007/978-1-4757-5795-8 |
Beschreibung: | Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the "shortest" path and the folded state of a protein corresponds to the structure with the "minimum" potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one? What is the difference of this book from the others? The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization |
Umfang: | 1 Online-Ressource (XIII, 273 p) |
ISBN: | 9781475757958 9781441952028 |
ISSN: | 1571-568X |
DOI: | 10.1007/978-1-4757-5795-8 |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV042421674 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s2001 xx o|||| 00||| eng d | ||
020 | |a 9781475757958 |c Online |9 978-1-4757-5795-8 | ||
020 | |a 9781441952028 |c Print |9 978-1-4419-5202-8 | ||
024 | 7 | |a 10.1007/978-1-4757-5795-8 |2 doi | |
035 | |a (OCoLC)1184494199 | ||
035 | |a (DE-599)BVBBV042421674 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 519.6 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Du, Ding-Zhu |e Verfasser |4 aut | |
245 | 1 | 0 | |a Mathematical Theory of Optimization |c edited by Ding-Zhu Du, Panos M. Pardalos, Weili Wu |
264 | 1 | |a Boston, MA |b Springer US |c 2001 | |
300 | |a 1 Online-Ressource (XIII, 273 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Nonconvex Optimization and Its Applications |v 56 |x 1571-568X | |
500 | |a Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the "shortest" path and the folded state of a protein corresponds to the structure with the "minimum" potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one? What is the difference of this book from the others? The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Information theory | |
650 | 4 | |a Computer science | |
650 | 4 | |a Computer science / Mathematics | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Mathematical optimization | |
650 | 4 | |a Optimization | |
650 | 4 | |a Theory of Computation | |
650 | 4 | |a Computational Mathematics and Numerical Analysis | |
650 | 4 | |a Mathematics of Computing | |
650 | 4 | |a Informatik | |
650 | 4 | |a Mathematik | |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Pardalos, Panos M. |e Sonstige |4 oth | |
700 | 1 | |a Wu, Weili |e Sonstige |4 oth | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-5795-8 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA | ||
912 | |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027857091 |
Datensatz im Suchindex
DE-BY-TUM_katkey | 2068683 |
---|---|
_version_ | 1821931221200928770 |
any_adam_object | |
author | Du, Ding-Zhu |
author_facet | Du, Ding-Zhu |
author_role | aut |
author_sort | Du, Ding-Zhu |
author_variant | d z d dzd |
building | Verbundindex |
bvnumber | BV042421674 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)1184494199 (DE-599)BVBBV042421674 |
dewey-full | 519.6 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.6 |
dewey-search | 519.6 |
dewey-sort | 3519.6 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-1-4757-5795-8 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03590nam a2200589zcb4500</leader><controlfield tag="001">BV042421674</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475757958</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-5795-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441952028</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-5202-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-5795-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184494199</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421674</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Ding-Zhu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical Theory of Optimization</subfield><subfield code="c">edited by Ding-Zhu Du, Panos M. Pardalos, Weili Wu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIII, 273 p)</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">Nonconvex Optimization and Its Applications</subfield><subfield code="v">56</subfield><subfield code="x">1571-568X</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Optimization is of central importance in all sciences. Nature inherently seeks optimal solutions. For example, light travels through the "shortest" path and the folded state of a protein corresponds to the structure with the "minimum" potential energy. In combinatorial optimization, there are numerous computationally hard problems arising in real world applications, such as floorplanning in VLSI designs and Steiner trees in communication networks. For these problems, the exact optimal solution is not currently real-time computable. One usually computes an approximate solution with various kinds of heuristics. Recently, many approaches have been developed that link the discrete space of combinatorial optimization to the continuous space of nonlinear optimization through geometric, analytic, and algebraic techniques. Many researchers have found that such approaches lead to very fast and efficient heuristics for solving large problems. Although almost all such heuristics work well in practice there is no solid theoretical analysis, except Karmakar's algorithm for linear programming. With this situation in mind, we decided to teach a seminar on nonlinear optimization with emphasis on its mathematical foundations. This book is the result of that seminar. During the last decades many textbooks and monographs in nonlinear optimization have been published. Why should we write this new one? What is the difference of this book from the others? The motivation for writing this book originated from our efforts to select a textbook for a graduate seminar with focus on the mathematical foundations of optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</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="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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">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="700" ind1="1" ind2=" "><subfield code="a">Pardalos, Panos M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Weili</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-5795-8</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027857091</subfield></datafield></record></collection> |
id | DE-604.BV042421674 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T17:10:45Z |
institution | BVB |
isbn | 9781475757958 9781441952028 |
issn | 1571-568X |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027857091 |
oclc_num | 1184494199 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (XIII, 273 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer US |
record_format | marc |
series2 | Nonconvex Optimization and Its Applications |
spellingShingle | Du, Ding-Zhu Mathematical Theory of Optimization Mathematics Information theory Computer science Computer science / Mathematics Algorithms Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Mathematics of Computing Informatik Mathematik Optimierung (DE-588)4043664-0 gnd |
subject_GND | (DE-588)4043664-0 |
title | Mathematical Theory of Optimization |
title_auth | Mathematical Theory of Optimization |
title_exact_search | Mathematical Theory of Optimization |
title_full | Mathematical Theory of Optimization edited by Ding-Zhu Du, Panos M. Pardalos, Weili Wu |
title_fullStr | Mathematical Theory of Optimization edited by Ding-Zhu Du, Panos M. Pardalos, Weili Wu |
title_full_unstemmed | Mathematical Theory of Optimization edited by Ding-Zhu Du, Panos M. Pardalos, Weili Wu |
title_short | Mathematical Theory of Optimization |
title_sort | mathematical theory of optimization |
topic | Mathematics Information theory Computer science Computer science / Mathematics Algorithms Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Mathematics of Computing Informatik Mathematik Optimierung (DE-588)4043664-0 gnd |
topic_facet | Mathematics Information theory Computer science Computer science / Mathematics Algorithms Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Mathematics of Computing Informatik Mathematik Optimierung |
url | https://doi.org/10.1007/978-1-4757-5795-8 |
work_keys_str_mv | AT dudingzhu mathematicaltheoryofoptimization AT pardalospanosm mathematicaltheoryofoptimization AT wuweili mathematicaltheoryofoptimization |