Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia
SIAM [u.a.]
2001
|
| Schriftenreihe: | MPS/SIAM series on optimization
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | XVI, 488 S. graph. Darst. |
| ISBN: | 0898714915 9780898714913 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV014091122 | ||
| 003 | DE-604 | ||
| 005 | 20180105 | ||
| 007 | t | ||
| 008 | 020114s2001 d||| |||| 00||| eng d | ||
| 020 | |a 0898714915 |9 0-898714-91-5 | ||
| 020 | |a 9780898714913 |9 978-0-898714-91-3 | ||
| 035 | |a (OCoLC)248143908 | ||
| 035 | |a (DE-599)BVBBV014091122 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-91 |a DE-91G |a DE-29T |a DE-634 |a DE-83 |a DE-11 |a DE-739 |a DE-188 |a DE-384 | ||
| 050 | 0 | |a T57.815 | |
| 082 | 0 | |a 519.7/6 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a 65K05 |2 msc | ||
| 084 | |a 90C51 |2 msc | ||
| 084 | |a 90C25 |2 msc | ||
| 084 | |a MAT 915f |2 stub | ||
| 100 | 1 | |a Ben-Tal, Aharon |e Verfasser |0 (DE-588)170328007 |4 aut | |
| 245 | 1 | 0 | |a Lectures on modern convex optimization |b analysis, algorithms, and engineering applications |c Aharon Ben-Tal ; Arkadi Nemirovski |
| 264 | 1 | |a Philadelphia |b SIAM [u.a.] |c 2001 | |
| 300 | |a XVI, 488 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a MPS/SIAM series on optimization | |
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 4 | |a Konvexe Optimierung | |
| 650 | 0 | 7 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Nemirovskij, Arkadij S. |d 1947- |e Verfasser |0 (DE-588)12209395X |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009652906&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009652906 | ||
Datensatz im Suchindex
| _version_ | 1804128956944744448 |
|---|---|
| adam_text | Contents
Preface xi
1 Linear Programming 1
1.1 Linear programming: Basic notions 1
1.2 Example: Tschebyshev approximation and its applications 2
1.2.1 Best uniform approximation 2
1.2.2 Application: Synthesis of filters 3
1.2.3 Filter synthesis revisited 5
1.2.4 Synthesis of arrays of antennae 7
1.3 Duality in linear programming 11
1.3.1 Certificates for solvability and insolvability 12
1.3.2 Dual to a linear programming program: Origin 16
1.3.3 Linear programming duality theorem 17
1.3.4 Illustration: Problem dual to the Tschebyshev
approximation problem 19
1.3.5 Application: Truss topology design 21
1.4 Exercises to Lecture 1 30
1.4.1 Uniform approximation 30
1.4.2 Theorem on the alternative 34
1.4.3 Proof of the homogeneous Farkas lemma 35
1.4.4 Helley theorem 38
1.4.5 How many bars are needed in an optimal truss? 40
2 From Linear Programming to Conic Programming 43
2.1 Orderings of Rm and convex cones 44
2.2 What is conic programming? 46
2.3 Conic duality 50
2.3.1 Geometry of the primal and dual problems 53
2.4 Conic duality theorem 57
2.4.1 Is something wrong with conic duality? 60
2.4.2 Consequences of the conic duality theorem 61
2.4.3 Robust solvability status 64
2.5 Conic duality revisited 67
2.6 Exercises to Lecture 2 73
vii
viii Contents
2.6.1 Cones 73
2.6.2 Conic problems 76
2.6.3 Feasible and level sets of conic problems 77
3 Conic Quadratic Programming 79
3.1 Conic quadratic problems: Preliminaries 79
3.2 Examples of conic quadratic problems 81
3.2.1 Best linear approximation of complex valued functions. . 81
3.2.2 Contact problems with static friction 82
3.3 What can be expressed via conic quadratic constraints? 85
3.3.1 More examples of conic quadratic representable
functions and sets 104
3.4 More applications 109
3.4.1 Tschebyshev approximation in relative scale 109
3.4.2 Robust linear programming 110
3.4.3 Trass topology design 120
3.5 Exercises to Lecture 3 131
3.5.1 Optimal control in discrete time linear dynamic system. . 131
3.5.2 Conic quadratic representations 132
3.5.3 Does conic quadratic programming exist? 137
4 Semidefinite Programming 139
4.1 Semidefinite cone and semidefinite programs 139
4.1.1 Preliminaries 139
4.2 What can be expressed via linear matrix inequalities? 144
4.3 Applications I: Combinatorics 159
4.3.1 Shor s semidefinite relaxation scheme 161
4.3.2 Stability number, Shannon capacity, and Lovasz
capacity of a graph 164
4.3.3 MAXCUT problem 170
4.3.4 Extensions 172
4.3.5 S lemma 175
4.4 Applications II: Stability analysis 178
4.4.1 Dynamic stability in mechanics 178
4.4.2 Lyapunov stability analysis and synthesis 180
4.4.3 Interval stability analysis and synthesis 189
4.5 Applications III: Robust quadratic programming 202
4.6 Applications IV: Synthesis of filters and antennae arrays 210
4.7 Applications V: Design of chips 219
4.7.1 Building the model 220
4.7.2 Wire sizing 226
4.8 Applications VI: Structural design 227
4.8.1 Building a model 228
4.8.2 Standard case 233
4.8.3 Semidefinite reformulation of the standard SSD problem 236
4.8.4 From primal to dual 243
Contents ix
4.8.5 Back to primal 248
4.8.6 Explicit forms of the standard truss and shape problems. . 252
4.9 Applications VII: Extremal ellipsoids 257
4.9.1 Ellipsoidal approximations of unions and intersections
of ellipsoids 262
4.9.2 Approximating sums of ellipsoids 264
4.10 Exercises to Lecture 4 276
4.10.1 Around positive semidefiniteness, eigenvalues, and
: ordering 276
4.10.2 Semidefinite representations of epigraphs of convex
polynomials 291
4.10.3 Lovasz capacity number and semidefinite relaxations of
combinatorial problems 293
4.10.4 Lyapunov stability analysis 299
4.10.5 S lemma 300
4.10.6 Antenna synthesis 323
4.10.7 Ellipsoidal approximations 326
5 Computational Tractability of Convex Programs 335
5.1 Numerical solution of optimization programs—preliminaries 335
5.1.1 Mathematical programming programs 335
5.1.2 Solution methods and efficiency 336
5.2 Black box represented convex programs 342
5.3 Polynomial solvability of convex programming 352
5.3.1 Polynomial solvability of convex programming 359
5.4 Difficult problems and NP completeness 363
5.4.1 CCT—a quick introduction 363
5.4.2 From the real arithmetic complexity theory to the
CCT and back 367
6 Interior Point Polynomial Time Methods for Linear Programming,
Conic Quadratic Programming, and Semidefinite Programming 377
6.1 Motivation 377
6.1.1 Interior point methods 378
6.2 Newton method and the interior penalty scheme 379
6.2.1 Unconstrained minimization and the Newton method . . . 379
6.2.2 Classical interior penalty scheme: Construction 380
6.2.3 Classical interior penalty scheme: Drawbacks 382
6.2.4 But 382
6.3 Interior point methods for linear programming, conic quadratic
programming, and semidefinite programming: Building blocks .... 384
6.3.1 Canonical cones and canonical barriers 384
6.3.2 Elementary properties of canonical barriers 387
6.4 Primal dual pair of problems and the primal dual central path 389
6.4.1 Problem(s) 389
6.4.2 Central path(s) 390
x Contents
6.5 Tracing the central path 397
6.5.1 Path following scheme 397
6.5.2 Speed of path tracing 398
6.5.3 Primal and dual path following methods 402
6.5.4 Semideflnite programming case 405
6.6 Complexity bounds for linear programming, conic quadratic
programming, and semidefinite programming 421
6.6.1 Complexity of linear programming 422
6.6.2 Complexity of conic quadratic programming 423
6.6.3 Semideflnite programming 423
6.7 Concluding remarks 424
6.8 Exercises to Lecture 6 426
6.8.1 Canonical barriers 426
6.8.2 Scalings of canonical cones 427
6.8.3 Dikin ellipsoid 429
6.8.4 More on canonical barriers 431
6.8.5 Primal path following method 432
6.8.6 Infeasible start path following method 435
Solutions to Selected Exercises 443
Exercises to Lecture 1 443
Exercises to Lecture 2 446
Exercises to Lecture 3 449
Exercises to Lecture 4 459
Exercises to Lecture 6 475
Index 485
|
| any_adam_object | 1 |
| author | Ben-Tal, Aharon Nemirovskij, Arkadij S. 1947- |
| author_GND | (DE-588)170328007 (DE-588)12209395X |
| author_facet | Ben-Tal, Aharon Nemirovskij, Arkadij S. 1947- |
| author_role | aut aut |
| author_sort | Ben-Tal, Aharon |
| author_variant | a b t abt a s n as asn |
| building | Verbundindex |
| bvnumber | BV014091122 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.815 |
| callnumber-search | T57.815 |
| callnumber-sort | T 257.815 |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 870 |
| classification_tum | MAT 915f |
| ctrlnum | (OCoLC)248143908 (DE-599)BVBBV014091122 |
| dewey-full | 519.7/6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7/6 |
| dewey-search | 519.7/6 |
| dewey-sort | 3519.7 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01758nam a2200445 c 4500</leader><controlfield tag="001">BV014091122</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180105 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020114s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898714915</subfield><subfield code="9">0-898714-91-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898714913</subfield><subfield code="9">978-0-898714-91-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248143908</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014091122</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.815</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/6</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C51</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 915f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Tal, Aharon</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170328007</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lectures on modern convex optimization</subfield><subfield code="b">analysis, algorithms, and engineering applications</subfield><subfield code="c">Aharon Ben-Tal ; Arkadi Nemirovski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia</subfield><subfield code="b">SIAM [u.a.]</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 488 S.</subfield><subfield code="b">graph. Darst.</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="490" ind1="0" ind2=" "><subfield code="a">MPS/SIAM series on optimization</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Konvexe Optimierung</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konvexe Optimierung</subfield><subfield code="0">(DE-588)4137027-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Konvexe Optimierung</subfield><subfield code="0">(DE-588)4137027-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nemirovskij, Arkadij S.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12209395X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=009652906&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009652906</subfield></datafield></record></collection> |
| id | DE-604.BV014091122 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:57:29Z |
| institution | BVB |
| isbn | 0898714915 9780898714913 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009652906 |
| oclc_num | 248143908 |
| open_access_boolean | |
| owner | DE-20 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-634 DE-83 DE-11 DE-739 DE-188 DE-384 |
| owner_facet | DE-20 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-634 DE-83 DE-11 DE-739 DE-188 DE-384 |
| physical | XVI, 488 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | SIAM [u.a.] |
| record_format | marc |
| series2 | MPS/SIAM series on optimization |
| spelling | Ben-Tal, Aharon Verfasser (DE-588)170328007 aut Lectures on modern convex optimization analysis, algorithms, and engineering applications Aharon Ben-Tal ; Arkadi Nemirovski Philadelphia SIAM [u.a.] 2001 XVI, 488 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier MPS/SIAM series on optimization Hier auch später erschienene, unveränderte Nachdrucke Konvexe Optimierung Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 s DE-604 Nemirovskij, Arkadij S. 1947- Verfasser (DE-588)12209395X aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009652906&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Ben-Tal, Aharon Nemirovskij, Arkadij S. 1947- Lectures on modern convex optimization analysis, algorithms, and engineering applications Konvexe Optimierung Konvexe Optimierung (DE-588)4137027-2 gnd |
| subject_GND | (DE-588)4137027-2 |
| title | Lectures on modern convex optimization analysis, algorithms, and engineering applications |
| title_auth | Lectures on modern convex optimization analysis, algorithms, and engineering applications |
| title_exact_search | Lectures on modern convex optimization analysis, algorithms, and engineering applications |
| title_full | Lectures on modern convex optimization analysis, algorithms, and engineering applications Aharon Ben-Tal ; Arkadi Nemirovski |
| title_fullStr | Lectures on modern convex optimization analysis, algorithms, and engineering applications Aharon Ben-Tal ; Arkadi Nemirovski |
| title_full_unstemmed | Lectures on modern convex optimization analysis, algorithms, and engineering applications Aharon Ben-Tal ; Arkadi Nemirovski |
| title_short | Lectures on modern convex optimization |
| title_sort | lectures on modern convex optimization analysis algorithms and engineering applications |
| title_sub | analysis, algorithms, and engineering applications |
| topic | Konvexe Optimierung Konvexe Optimierung (DE-588)4137027-2 gnd |
| topic_facet | Konvexe Optimierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009652906&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bentalaharon lecturesonmodernconvexoptimizationanalysisalgorithmsandengineeringapplications AT nemirovskijarkadijs lecturesonmodernconvexoptimizationanalysisalgorithmsandengineeringapplications |