Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2002
|
| Schriftenreihe: | Applied Optimization
65 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming. In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming |
| Beschreibung: | 1 Online-Ressource (XVI, 288 p) |
| ISBN: | 9780306478192 9781402005473 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/b105286 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042418884 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9780306478192 |c Online |9 978-0-306-47819-2 | ||
| 020 | |a 9781402005473 |c Print |9 978-1-4020-0547-3 | ||
| 024 | 7 | |a 10.1007/b105286 |2 doi | |
| 035 | |a (OCoLC)1165515790 | ||
| 035 | |a (DE-599)BVBBV042418884 | ||
| 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 Klerk, Etienne |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Aspects of Semidefinite Programming |b Interior Point Algorithms and Selected Applications |c by Etienne Klerk |
| 264 | 1 | |a Boston, MA |b Springer US |c 2002 | |
| 300 | |a 1 Online-Ressource (XVI, 288 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied Optimization |v 65 |x 1384-6485 | |
| 500 | |a Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming. In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 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 Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Semidefinite Optimierung |0 (DE-588)4663806-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Semidefinite Optimierung |0 (DE-588)4663806-4 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b105286 |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-027854301 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153088862322688 |
|---|---|
| any_adam_object | |
| author | Klerk, Etienne |
| author_facet | Klerk, Etienne |
| author_role | aut |
| author_sort | Klerk, Etienne |
| author_variant | e k ek |
| building | Verbundindex |
| bvnumber | BV042418884 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1165515790 (DE-599)BVBBV042418884 |
| 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/b105286 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02751nmm a2200541zcb4500</leader><controlfield tag="001">BV042418884</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780306478192</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-306-47819-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781402005473</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4020-0547-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b105286</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1165515790</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042418884</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">Klerk, Etienne</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Aspects of Semidefinite Programming</subfield><subfield code="b">Interior Point Algorithms and Selected Applications</subfield><subfield code="c">by Etienne Klerk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 288 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">Applied Optimization</subfield><subfield code="v">65</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming. In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming</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 / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</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">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">Semidefinite Optimierung</subfield><subfield code="0">(DE-588)4663806-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Semidefinite Optimierung</subfield><subfield code="0">(DE-588)4663806-4</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/b105286</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-027854301</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.BV042418884 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:03Z |
| institution | BVB |
| isbn | 9780306478192 9781402005473 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854301 |
| oclc_num | 1165515790 |
| 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, 288 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer US |
| record_format | marc |
| series2 | Applied Optimization |
| spelling | Klerk, Etienne Verfasser aut Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications by Etienne Klerk Boston, MA Springer US 2002 1 Online-Ressource (XVI, 288 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 65 1384-6485 Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming. In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson. Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming Mathematics Information theory Computer science / Mathematics Algorithms Combinatorics Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Informatik Mathematik Semidefinite Optimierung (DE-588)4663806-4 gnd rswk-swf Semidefinite Optimierung (DE-588)4663806-4 s 1\p DE-604 https://doi.org/10.1007/b105286 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Klerk, Etienne Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications Mathematics Information theory Computer science / Mathematics Algorithms Combinatorics Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Informatik Mathematik Semidefinite Optimierung (DE-588)4663806-4 gnd |
| subject_GND | (DE-588)4663806-4 |
| title | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications |
| title_auth | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications |
| title_exact_search | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications |
| title_full | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications by Etienne Klerk |
| title_fullStr | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications by Etienne Klerk |
| title_full_unstemmed | Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications by Etienne Klerk |
| title_short | Aspects of Semidefinite Programming |
| title_sort | aspects of semidefinite programming interior point algorithms and selected applications |
| title_sub | Interior Point Algorithms and Selected Applications |
| topic | Mathematics Information theory Computer science / Mathematics Algorithms Combinatorics Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Informatik Mathematik Semidefinite Optimierung (DE-588)4663806-4 gnd |
| topic_facet | Mathematics Information theory Computer science / Mathematics Algorithms Combinatorics Mathematical optimization Optimization Theory of Computation Computational Mathematics and Numerical Analysis Informatik Mathematik Semidefinite Optimierung |
| url | https://doi.org/10.1007/b105286 |
| work_keys_str_mv | AT klerketienne aspectsofsemidefiniteprogramminginteriorpointalgorithmsandselectedapplications |