Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2000
|
| Schriftenreihe: | Nonconvex Optimization and Its Applications
42 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida |
| Beschreibung: | 1 Online-Ressource (XIV, 581 p) |
| ISBN: | 9781475731453 9781441948298 |
| ISSN: | 1571-568X |
| DOI: | 10.1007/978-1-4757-3145-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421429 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475731453 |c Online |9 978-1-4757-3145-3 | ||
| 020 | |a 9781441948298 |c Print |9 978-1-4419-4829-8 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3145-3 |2 doi | |
| 035 | |a (OCoLC)1184505302 | ||
| 035 | |a (DE-599)BVBBV042421429 | ||
| 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 515.64 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Pardalos, Panos M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximation and Complexity in Numerical Optimization |b Continuous and Discrete Problems |c edited by Panos M. Pardalos |
| 264 | 1 | |a Boston, MA |b Springer US |c 2000 | |
| 300 | |a 1 Online-Ressource (XIV, 581 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 42 |x 1571-568X | |
| 500 | |a There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Approximations and Expansions | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 1999 |z Gainesville Fla. |2 gnd-content | |
| 655 | 7 | |8 2\p |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | 2 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |D s |
| 689 | 0 | |8 3\p |5 DE-604 | |
| 689 | 1 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |8 4\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3145-3 |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-027856846 | ||
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153094471155712 |
|---|---|
| any_adam_object | |
| author | Pardalos, Panos M. |
| author_facet | Pardalos, Panos M. |
| author_role | aut |
| author_sort | Pardalos, Panos M. |
| author_variant | p m p pm pmp |
| building | Verbundindex |
| bvnumber | BV042421429 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184505302 (DE-599)BVBBV042421429 |
| dewey-full | 515.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 515 - Analysis |
| dewey-raw | 515.64 |
| dewey-search | 515.64 |
| dewey-sort | 3515.64 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4757-3145-3 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04220nmm a2200637zcb4500</leader><controlfield tag="001">BV042421429</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475731453</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-3145-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441948298</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4829-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3145-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184505302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421429</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">515.64</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">Pardalos, Panos M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation and Complexity in Numerical Optimization</subfield><subfield code="b">Continuous and Discrete Problems</subfield><subfield code="c">edited by Panos M. Pardalos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 581 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">42</subfield><subfield code="x">1571-568X</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida</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">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; 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">Approximations and Expansions</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="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-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)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1999</subfield><subfield code="z">Gainesville Fla.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">2\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</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="1"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">4\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-3145-3</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-027856846</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="883" ind1="1" ind2=" "><subfield code="8">3\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">4\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> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 1999 Gainesville Fla. gnd-content 2\p (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift 1999 Gainesville Fla. Konferenzschrift |
| id | DE-604.BV042421429 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:09Z |
| institution | BVB |
| isbn | 9781475731453 9781441948298 |
| issn | 1571-568X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856846 |
| oclc_num | 1184505302 |
| 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 (XIV, 581 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer US |
| record_format | marc |
| series2 | Nonconvex Optimization and Its Applications |
| spelling | Pardalos, Panos M. Verfasser aut Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems edited by Panos M. Pardalos Boston, MA Springer US 2000 1 Online-Ressource (XIV, 581 p) txt rdacontent c rdamedia cr rdacarrier Nonconvex Optimization and Its Applications 42 1571-568X There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida Mathematics Information theory Mathematical optimization Calculus of Variations and Optimal Control; Optimization Theory of Computation Approximations and Expansions Mathematik Optimierung (DE-588)4043664-0 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Numerisches Verfahren (DE-588)4128130-5 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 1999 Gainesville Fla. gnd-content 2\p (DE-588)1071861417 Konferenzschrift gnd-content Optimierung (DE-588)4043664-0 s Approximation (DE-588)4002498-2 s Numerisches Verfahren (DE-588)4128130-5 s 3\p DE-604 Berechnungskomplexität (DE-588)4134751-1 s 4\p DE-604 https://doi.org/10.1007/978-1-4757-3145-3 Verlag 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Pardalos, Panos M. Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems Mathematics Information theory Mathematical optimization Calculus of Variations and Optimal Control; Optimization Theory of Computation Approximations and Expansions Mathematik Optimierung (DE-588)4043664-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Approximation (DE-588)4002498-2 gnd Numerisches Verfahren (DE-588)4128130-5 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4134751-1 (DE-588)4002498-2 (DE-588)4128130-5 (DE-588)1071861417 |
| title | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems |
| title_auth | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems |
| title_exact_search | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems |
| title_full | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems edited by Panos M. Pardalos |
| title_fullStr | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems edited by Panos M. Pardalos |
| title_full_unstemmed | Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems edited by Panos M. Pardalos |
| title_short | Approximation and Complexity in Numerical Optimization |
| title_sort | approximation and complexity in numerical optimization continuous and discrete problems |
| title_sub | Continuous and Discrete Problems |
| topic | Mathematics Information theory Mathematical optimization Calculus of Variations and Optimal Control; Optimization Theory of Computation Approximations and Expansions Mathematik Optimierung (DE-588)4043664-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Approximation (DE-588)4002498-2 gnd Numerisches Verfahren (DE-588)4128130-5 gnd |
| topic_facet | Mathematics Information theory Mathematical optimization Calculus of Variations and Optimal Control; Optimization Theory of Computation Approximations and Expansions Mathematik Optimierung Berechnungskomplexität Approximation Numerisches Verfahren Konferenzschrift 1999 Gainesville Fla. Konferenzschrift |
| url | https://doi.org/10.1007/978-1-4757-3145-3 |
| work_keys_str_mv | AT pardalospanosm approximationandcomplexityinnumericaloptimizationcontinuousanddiscreteproblems |