Deterministic approximation algorithms in computational convexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
1998
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVIII, IV, 128 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012095151 | ||
| 003 | DE-604 | ||
| 005 | 19981204 | ||
| 007 | t | ||
| 008 | 980811s1998 m||| 00||| engod | ||
| 016 | 7 | |a 954474325 |2 DE-101 | |
| 035 | |a (OCoLC)75908655 | ||
| 035 | |a (DE-599)BVBBV012095151 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-91G |a DE-29T |a DE-12 |a DE-706 |a DE-11 |a DE-188 | ||
| 084 | |a MAT 525d |2 stub | ||
| 084 | |a MAT 910d |2 stub | ||
| 084 | |a DAT 756d |2 stub | ||
| 100 | 1 | |a Brieden, Andreas |d 1969- |e Verfasser |0 (DE-588)114847444 |4 aut | |
| 245 | 1 | 0 | |a Deterministic approximation algorithms in computational convexity |c Andreas Brieden |
| 264 | 1 | |c 1998 | |
| 300 | |a XVIII, IV, 128 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a München, Techn. Univ., Diss., 1998 | ||
| 650 | 0 | 7 | |a Konvexität |0 (DE-588)4114284-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | 1 | |a Konvexität |0 (DE-588)4114284-6 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008190918&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008190918 | |
Datensatz im Suchindex
| _version_ | 1812452949976154112 |
|---|---|
| adam_text |
TABLE OF CONTENTS
1. INTRODUCTION
. 1
1.1 COMPUTATIONAL CONVEXITY . 1
1.2 RADII, CONDITION NUMBERS, POSDEF-0- 1-MAX AND SIMPLICES
. 2
1.2.1 RADII AND NORM-MAXIMIZATION. 3
1.2.2 CONDITION NUMBERS AND POSDEF-O-L-MAX. 7
1.2.3 LARGEST SIMPLICES IN BODIES. 12
1.3 DETERMINISM VERSUS RANDOMIZATION. 15
1.4 ACKNOWLEDGMENTS. 16
2.
PRELIMINARIES. 17
2.1 CONVEX SETS, BASIC PROBLEMS AND POLY TOPES. 17
2.2 COMPUTING MODEL AND ALGORITHMIC THEORY OF CONVEX BODIES . 18
2.3 GEOMETRIC PROPERTIES OF RADII. 23
2.4 VOLUME FORMULAS AND LARGEST SIMPLICES IN ELLIPSOIDS. 26
3. APPROXIMATION OF RADII AND NORM-MAXIMIZATION
. 31
3.1 SOLUTION WITH RESPECT TO POLYTOPAL NORMS. 32
3.1.1 INRADIUS AND WIDTH. 32
3.1.2 CIRCUMRADIUS, DIAMETER AND NORM-MAXIMIZATION. 36
3.2 APPROXIMATION OF
LP UNIT BALLS BY POLYTOPES. 41
3.2.1 APPROXIMATION IN M-DIMENSIONAL SUBSPACES. 41
3.2.2 POLYNOMIAL SIZE APPROXIMATION. 46
3.2.3 IMPROVING THE PERFORMANCE BY USING HADAMARD MATRICES? 48
3.3 APPROXIMATION ALGORITHMS. 55
3.4 UPPER BOUNDS. 58
4. APPROXIMATION OF CONDITION NUMBERS AND POSDEF-0-1-MAX
. 63
4.1 CONDITION NUMBERS OF CONVEX BODIES. 63
4.1.1 COMPLEXITY OF COMPUTING CONDITION NUMBERS OF POLYTOPES 63
4.1.2 LOWER BOUNDS FOR (ORACLE-) POLYNOMIAL-TIME ALGORITHMS . 64
4.1.3 UPPER BOUNDS FOR ORACLE-POLYNOMIAL-TIME ALGORITHMS . . 66
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/954474325
TABLE OF CONTENTS
4.2
APPROXIMATION OF POSDEF-O-L-MAXIMIZATION .
4.2.1 TRANSFORMING POSDEF-0-1-MAX TO SIMPLEX-WIDTH . .
4.2.2
SOLVING POSDEF-0- 1-MAX BY APPROXIMATING BOO.
5.
APPROXIMATION OF LARGEST SIMPLICES IN BODIES.
5.1 A LOWER BOUND FOR LARGEST SIMPLICES APPROXIMATION.
5.1.1 THE GEOMETRIC IDEA.
5.1.2 A MODIFIED SHALLOW-CUT ELLIPSOID ALGORITHM.
5.2 AN UPPER BOUND FOR LARGEST SIMPLICES APPROXIMATION.
5.2.1 MOTIVATION.
5.2.2 LARGE J-SIMPLICES IN NORMALIZED 'H-POLYTOPES OF POLYNO
MIAL SIZE.
APPENDIX
.
A.
ENTROPY IN BANACH SPACES.
B. JACOBI'S METHOD IN FINITE PRECISION
.
C. APPROXIMATION OF M{E\ J, N) IN FINITE PRECISION
REFERENCES.
68
68
73
75
75
75
76
82
82
82
85
87
97
115
119
N |
| any_adam_object | 1 |
| author | Brieden, Andreas 1969- |
| author_GND | (DE-588)114847444 |
| author_facet | Brieden, Andreas 1969- |
| author_role | aut |
| author_sort | Brieden, Andreas 1969- |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV012095151 |
| classification_tum | MAT 525d MAT 910d DAT 756d |
| ctrlnum | (OCoLC)75908655 (DE-599)BVBBV012095151 |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV012095151</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19981204</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980811s1998 m||| 00||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">954474325</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75908655</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012095151</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 525d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 910d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 756d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brieden, Andreas</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)114847444</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Deterministic approximation algorithms in computational convexity</subfield><subfield code="c">Andreas Brieden</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, IV, 128 S.</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="502" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1998</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexität</subfield><subfield code="0">(DE-588)4114284-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Konvexität</subfield><subfield code="0">(DE-588)4114284-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008190918&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008190918</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV012095151 |
| illustrated | Not Illustrated |
| indexdate | 2024-10-09T16:03:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008190918 |
| oclc_num | 75908655 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-706 DE-11 DE-188 |
| owner_facet | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-706 DE-11 DE-188 |
| physical | XVIII, IV, 128 S. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| record_format | marc |
| spelling | Brieden, Andreas 1969- Verfasser (DE-588)114847444 aut Deterministic approximation algorithms in computational convexity Andreas Brieden 1998 XVIII, IV, 128 S. txt rdacontent n rdamedia nc rdacarrier München, Techn. Univ., Diss., 1998 Konvexität (DE-588)4114284-6 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Algorithmische Geometrie (DE-588)4130267-9 s Konvexität (DE-588)4114284-6 s Berechnungskomplexität (DE-588)4134751-1 s Algorithmus (DE-588)4001183-5 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008190918&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Brieden, Andreas 1969- Deterministic approximation algorithms in computational convexity Konvexität (DE-588)4114284-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4114284-6 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)4113937-9 |
| title | Deterministic approximation algorithms in computational convexity |
| title_auth | Deterministic approximation algorithms in computational convexity |
| title_exact_search | Deterministic approximation algorithms in computational convexity |
| title_full | Deterministic approximation algorithms in computational convexity Andreas Brieden |
| title_fullStr | Deterministic approximation algorithms in computational convexity Andreas Brieden |
| title_full_unstemmed | Deterministic approximation algorithms in computational convexity Andreas Brieden |
| title_short | Deterministic approximation algorithms in computational convexity |
| title_sort | deterministic approximation algorithms in computational convexity |
| topic | Konvexität (DE-588)4114284-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Konvexität Algorithmische Geometrie Algorithmus Berechnungskomplexität Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008190918&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT briedenandreas deterministicapproximationalgorithmsincomputationalconvexity |