Rigorous Global Search: Continuous Problems:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boston, MA
Springer US
1996
|
Schriftenreihe: | Nonconvex Optimization and Its Applications
13 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduction, a reference for the techniques, and a guide to the literature for the underlying theory. It contains pointers to fertile areas for future research. It also serves as introductory documentation for a Fortran 90 software package for nonlinear systems and global optimization. The subject of the monograph is deterministic, automatically verified or r- orous methods. In such methods, directed rounding and computational fix- point theory are combined with exhaustive search (branch and bound) te- niques. Completion of such an algorithm with a list of solutions constitutes a rigorous mathematical proof that all of the solutions within the original search region are within the output list. The monograph is appropriate as an introduction to research and technology in the area, as a desk reference, or as a graduate-level course reference. Kno- edge of calculus, linear algebra, and elementary numerical analysis is assumed |
Beschreibung: | 1 Online-Ressource (XVI, 264 p) |
ISBN: | 9781475724950 9781441947628 |
ISSN: | 1571-568X |
DOI: | 10.1007/978-1-4757-2495-0 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV042421350 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s1996 |||| o||u| ||||||eng d | ||
020 | |a 9781475724950 |c Online |9 978-1-4757-2495-0 | ||
020 | |a 9781441947628 |c Print |9 978-1-4419-4762-8 | ||
024 | 7 | |a 10.1007/978-1-4757-2495-0 |2 doi | |
035 | |a (OCoLC)863954547 | ||
035 | |a (DE-599)BVBBV042421350 | ||
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 Kearfott, R. Baker |e Verfasser |4 aut | |
245 | 1 | 0 | |a Rigorous Global Search: Continuous Problems |c by R. Baker Kearfott |
264 | 1 | |a Boston, MA |b Springer US |c 1996 | |
300 | |a 1 Online-Ressource (XVI, 264 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 13 |x 1571-568X | |
500 | |a This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduction, a reference for the techniques, and a guide to the literature for the underlying theory. It contains pointers to fertile areas for future research. It also serves as introductory documentation for a Fortran 90 software package for nonlinear systems and global optimization. The subject of the monograph is deterministic, automatically verified or r- orous methods. In such methods, directed rounding and computational fix- point theory are combined with exhaustive search (branch and bound) te- niques. Completion of such an algorithm with a list of solutions constitutes a rigorous mathematical proof that all of the solutions within the original search region are within the output list. The monograph is appropriate as an introduction to research and technology in the area, as a desk reference, or as a graduate-level course reference. Kno- edge of calculus, linear algebra, and elementary numerical analysis is assumed | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Software engineering | |
650 | 4 | |a Electronic data processing | |
650 | 4 | |a Mathematical optimization | |
650 | 4 | |a Operations research | |
650 | 4 | |a Optimization | |
650 | 4 | |a Numeric Computing | |
650 | 4 | |a Operation Research/Decision Theory | |
650 | 4 | |a Software Engineering/Programming and Operating Systems | |
650 | 4 | |a Datenverarbeitung | |
650 | 4 | |a Mathematik | |
650 | 0 | 7 | |a Globale Optimierung |0 (DE-588)4140067-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Nichtkonvexe Optimierung |0 (DE-588)4309215-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Globale Optimierung |0 (DE-588)4140067-7 |D s |
689 | 0 | 1 | |a Nichtkonvexe Optimierung |0 (DE-588)4309215-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-2495-0 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027856767 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804153094294994944 |
---|---|
any_adam_object | |
author | Kearfott, R. Baker |
author_facet | Kearfott, R. Baker |
author_role | aut |
author_sort | Kearfott, R. Baker |
author_variant | r b k rb rbk |
building | Verbundindex |
bvnumber | BV042421350 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)863954547 (DE-599)BVBBV042421350 |
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-2495-0 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03166nmm a2200565zcb4500</leader><controlfield tag="001">BV042421350</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475724950</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-2495-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441947628</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4762-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-2495-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863954547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421350</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">Kearfott, R. Baker</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Rigorous Global Search: Continuous Problems</subfield><subfield code="c">by R. Baker Kearfott</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 264 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">13</subfield><subfield code="x">1571-568X</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduction, a reference for the techniques, and a guide to the literature for the underlying theory. It contains pointers to fertile areas for future research. It also serves as introductory documentation for a Fortran 90 software package for nonlinear systems and global optimization. The subject of the monograph is deterministic, automatically verified or r- orous methods. In such methods, directed rounding and computational fix- point theory are combined with exhaustive search (branch and bound) te- niques. Completion of such an algorithm with a list of solutions constitutes a rigorous mathematical proof that all of the solutions within the original search region are within the output list. The monograph is appropriate as an introduction to research and technology in the area, as a desk reference, or as a graduate-level course reference. Kno- edge of calculus, linear algebra, and elementary numerical analysis is assumed</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numeric Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering/Programming and Operating Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Globale Optimierung</subfield><subfield code="0">(DE-588)4140067-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtkonvexe Optimierung</subfield><subfield code="0">(DE-588)4309215-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Globale Optimierung</subfield><subfield code="0">(DE-588)4140067-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Nichtkonvexe Optimierung</subfield><subfield code="0">(DE-588)4309215-9</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="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-2495-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856767</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></record></collection> |
id | DE-604.BV042421350 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:21:08Z |
institution | BVB |
isbn | 9781475724950 9781441947628 |
issn | 1571-568X |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856767 |
oclc_num | 863954547 |
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 (XVI, 264 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
publisher | Springer US |
record_format | marc |
series2 | Nonconvex Optimization and Its Applications |
spelling | Kearfott, R. Baker Verfasser aut Rigorous Global Search: Continuous Problems by R. Baker Kearfott Boston, MA Springer US 1996 1 Online-Ressource (XVI, 264 p) txt rdacontent c rdamedia cr rdacarrier Nonconvex Optimization and Its Applications 13 1571-568X This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduction, a reference for the techniques, and a guide to the literature for the underlying theory. It contains pointers to fertile areas for future research. It also serves as introductory documentation for a Fortran 90 software package for nonlinear systems and global optimization. The subject of the monograph is deterministic, automatically verified or r- orous methods. In such methods, directed rounding and computational fix- point theory are combined with exhaustive search (branch and bound) te- niques. Completion of such an algorithm with a list of solutions constitutes a rigorous mathematical proof that all of the solutions within the original search region are within the output list. The monograph is appropriate as an introduction to research and technology in the area, as a desk reference, or as a graduate-level course reference. Kno- edge of calculus, linear algebra, and elementary numerical analysis is assumed Mathematics Software engineering Electronic data processing Mathematical optimization Operations research Optimization Numeric Computing Operation Research/Decision Theory Software Engineering/Programming and Operating Systems Datenverarbeitung Mathematik Globale Optimierung (DE-588)4140067-7 gnd rswk-swf Nichtkonvexe Optimierung (DE-588)4309215-9 gnd rswk-swf Globale Optimierung (DE-588)4140067-7 s Nichtkonvexe Optimierung (DE-588)4309215-9 s 1\p DE-604 https://doi.org/10.1007/978-1-4757-2495-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Kearfott, R. Baker Rigorous Global Search: Continuous Problems Mathematics Software engineering Electronic data processing Mathematical optimization Operations research Optimization Numeric Computing Operation Research/Decision Theory Software Engineering/Programming and Operating Systems Datenverarbeitung Mathematik Globale Optimierung (DE-588)4140067-7 gnd Nichtkonvexe Optimierung (DE-588)4309215-9 gnd |
subject_GND | (DE-588)4140067-7 (DE-588)4309215-9 |
title | Rigorous Global Search: Continuous Problems |
title_auth | Rigorous Global Search: Continuous Problems |
title_exact_search | Rigorous Global Search: Continuous Problems |
title_full | Rigorous Global Search: Continuous Problems by R. Baker Kearfott |
title_fullStr | Rigorous Global Search: Continuous Problems by R. Baker Kearfott |
title_full_unstemmed | Rigorous Global Search: Continuous Problems by R. Baker Kearfott |
title_short | Rigorous Global Search: Continuous Problems |
title_sort | rigorous global search continuous problems |
topic | Mathematics Software engineering Electronic data processing Mathematical optimization Operations research Optimization Numeric Computing Operation Research/Decision Theory Software Engineering/Programming and Operating Systems Datenverarbeitung Mathematik Globale Optimierung (DE-588)4140067-7 gnd Nichtkonvexe Optimierung (DE-588)4309215-9 gnd |
topic_facet | Mathematics Software engineering Electronic data processing Mathematical optimization Operations research Optimization Numeric Computing Operation Research/Decision Theory Software Engineering/Programming and Operating Systems Datenverarbeitung Mathematik Globale Optimierung Nichtkonvexe Optimierung |
url | https://doi.org/10.1007/978-1-4757-2495-0 |
work_keys_str_mv | AT kearfottrbaker rigorousglobalsearchcontinuousproblems |