Convex optimization algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Belmont, Massachusetts
Athena Scientific
[2015]
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xii, 564 Seiten Illustrationen, Diagramme |
| ISBN: | 9781886529281 1886529280 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042442048 | ||
| 003 | DE-604 | ||
| 005 | 20241129 | ||
| 007 | t| | ||
| 008 | 150323s2015 xx a||| |||| 00||| eng d | ||
| 020 | |a 9781886529281 |c hbk. |9 978-1-886529-28-1 | ||
| 020 | |a 1886529280 |9 1-886529-28-0 | ||
| 035 | |a (OCoLC)908339429 | ||
| 035 | |a (DE-599)OBVAC12182784 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-83 |a DE-29T |a DE-706 |a DE-703 | ||
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a 90C25 |2 msc | ||
| 100 | 1 | |a Bertsekas, Dimitri P. |d 1942- |e Verfasser |0 (DE-588)171165519 |4 aut | |
| 245 | 1 | 0 | |a Convex optimization algorithms |c Dimitri P. Bertsekas (Massachusetts Institute of Technology) |
| 264 | 1 | |a Belmont, Massachusetts |b Athena Scientific |c [2015] | |
| 300 | |a xii, 564 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 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 | |
| 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=027877323&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027877323 | |
Datensatz im Suchindex
| _version_ | 1817046764719439872 |
|---|---|
| adam_text |
Titel: Convex optimization algorithms
Autor: Bertsekas, Dimitri P
Jahr: 2015
Contents
Convex Optimization Models: An Overview
1.1. Lagrange Duality.
1.1.1. Separable Problems - Decomposition
1.1.2. Partitioning.
1.2. Fenchel Duality and Conic Programming .
1.2.1. Linear Conic Problems .
1.2.2. Second Order Cone Programming . .
1.2.3. Semidefinite Programming . .
1.3. Additive Cost Problems.
1.4. Large Number of Constraints . . .
1.5. Exact Penalty Functions .
1.6. Notes, Sources, and Exercises . .
p. 2
p. 7
p. 9
p. 10
p. 15
p. 17
p. 22
p. 25
p. 34
p. 39
p. 47
2. Optimization Algorithms: An Overview.p. 53
2.1. Iterative Descent Algorithms.p. 55
2.1.1. Differentiable Cost Function Descent - Unconstrained .
Problems .p. 58
2.1.2. Constrained Problems - Feasible Direction Methods . . . p. 71
2.1.3. Nondifferentiable Problems - Subgradient Methods . . . p. 78
2.1.4. Alternative Descent Methods.p. 80
2.1.5. Incremental Algorithms.p. 83
2.1.6. Distributed Asynchronous Iterative Algorithms . p. 104
2.2. Approximation Methods .p. 106
2.2.1. Polyhedral Approximation.p. 107
2.2.2. Penalty, Augmented Lagrangian, and Inferior .
Point Methods.p. 108
2.2.3. Proximal Algorithm, Bündle Methods, and.
Tikhonov Regularization.p. 110
2.2.4. Alternating Direction Method of Multipliers.p. 111
2.2.5. Smoothing of Nondifferentiable Problems .p. 113
2.3. Notes, Sources, and Exercises .p. 119
3. Subgradient Methods.p. 135
3.1. Subgradients of Convex Real-Valued Functions.p. 136
iv Contents
3.1.1. Characterization of the Subdifferential. p. 146
3.2. Convergence Analysis of Subgradient Methods. p. 148
3.3. e-Subgradient Methods . p. 162
3.3.1. Connection with Incremental Subgradient Methods . . p. 166
3.4. Notes, Sources, and Exercises. p. 167
4. Polyhedral Approximation Methods. p. 181
4.1. Outer Linearization - Cutting Plane Methods . p. 182
4.2. Inner Linearization - Simplicial Decomposition. p. 188
4.3. Duality of Outer and Inner Linearization. p. 194
4.4. Generalized Polyhedral Approximation. p. 196
4.5. Generalized Simplicial Decomposition. p. 209
4.5.1. Differentiable Cost Case. p. 213
4.5.2. Nondifferentiable Cost and Side Constraints. p. 213
4.6. Polyhedral Approximation for Conic Programming . p. 217
4.7. Notes, Sources, and Exercises. p. 228
5. Proximal Algorithms . p. 233
5.1. Basic Theory of Proximal Algorithms. p. 234
5.1.1. Convergence. p. 235
5.1.2. Rate of Convergence. p. 239
5.1.3. Gradient Interpretation. p. 246
5.1.4. Fixed Point Interpretation, Overrelaxation,.
and Generalization. p. 248
5.2. Dual Proximal Algorithms. p. 256
5.2.1. Augmented Lagrangian Methods. p. 259
5.3. Proximal Algorithms with Linearization. p. 268
5.3.1. Proximal Cutting Plane Methods. p. 270
5.3.2. Bündle Methods. p. 272
5.3.3. Proximal Inner Linearization Methods. p. 276
5.4. Alternating Direction Methods of Multipliers. p. 280
5.4.1. Applications in Machine Learning. p. 286
5.4.2. ADMM Applied to Separable Problems. p. 289
5.5. Notes, Sources, and Exercises. p. 293
6. Additional Algorithmic Topics. p. 301
6.1. Gradient Projection Methods. p. 302
6.2. Gradient Projection with Extrapolation. p. 322
6.2.1. An Algorithm with Optimal Iteration Complexity . . . p. 323
6.2.2. Nondifferentiable Cost - Smoothing. p. 326
6.3. Proximal Gradient Methods. p. 330
6.4. Incremental Subgradient Proximal Methods. p. 340
6.4.1. Convergence for Methods with Cyclic Order. p. 344
Contents v
6.4.2. Convergence for Methods with Randomized Order . . p. 353
6.4.3. Application in Specially Structured Problems. p. 361
6.4.4. Incremental Constraint Projection Methods. p. 365
6.5. Coordinate Descent Methods. p. 369
6.5.1. Variants of Coordinate Descent. p. 373
6.5.2. Distributed Asynchronous Coordinate Descent . p. 376
6.6. Generalized Proximal Methods. p. 382
6.7. e-Descent and Extended Monotropic Programming . p. 396
6.7.1. e-Subgradients. p. 397
6.7.2. e-Descent Method. p. 400
6.7.3. Extended Monotropic Programming Duality. p. 406
6.7.4. Special Cases of Strong Duality. p. 408
6.8. Inferior Point Methods . p. 412
6.8.1. Primal-Dual Methods for Linear Programming . p. 416
6.8.2. Inferior Point Methods for Conic Programming . p. 423
6.8.3. Central Cutting Plane Methods. p. 425
6.9. Notes, Sources, and Exercises. p. 426
Appendix A: Mathematical Background. p. 443
A.l. Linear Algebra. p. 445
A.2. Topological Properties . p. 450
A.3. Derivatives . p. 456
A.4. Convergence Theorems. p. 458
Appendix B: Convex Optimization Theory: A Summary . p. 467
B.l. Basic Concepts of Convex Analysis. p. 467
B.2. Basic Concepts of Polyhedral Convexity. p. 489
B.3. Basic Concepts of Convex Optimization. p. 494
B.4. Geometrie Duality Framework. p. 498
B.5. Duality and Optimization. p. 505
References.p. 519
Index.p. 557 |
| any_adam_object | 1 |
| author | Bertsekas, Dimitri P. 1942- |
| author_GND | (DE-588)171165519 |
| author_facet | Bertsekas, Dimitri P. 1942- |
| author_role | aut |
| author_sort | Bertsekas, Dimitri P. 1942- |
| author_variant | d p b dp dpb |
| building | Verbundindex |
| bvnumber | BV042442048 |
| classification_rvk | SK 870 |
| ctrlnum | (OCoLC)908339429 (DE-599)OBVAC12182784 |
| discipline | Mathematik |
| format | 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">BV042442048</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241129</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">150323s2015 xx a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781886529281</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-1-886529-28-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1886529280</subfield><subfield code="9">1-886529-28-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)908339429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)OBVAC12182784</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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-83</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-703</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">90C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bertsekas, Dimitri P.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171165519</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convex optimization algorithms</subfield><subfield code="c">Dimitri P. Bertsekas (Massachusetts Institute of Technology)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Belmont, Massachusetts</subfield><subfield code="b">Athena Scientific</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 564 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="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="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=027877323&sequence=000002&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-027877323</subfield></datafield></record></collection> |
| id | DE-604.BV042442048 |
| illustrated | Illustrated |
| indexdate | 2024-11-29T09:00:30Z |
| institution | BVB |
| isbn | 9781886529281 1886529280 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027877323 |
| oclc_num | 908339429 |
| open_access_boolean | |
| owner | DE-20 DE-83 DE-29T DE-706 DE-703 |
| owner_facet | DE-20 DE-83 DE-29T DE-706 DE-703 |
| physical | xii, 564 Seiten Illustrationen, Diagramme |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Athena Scientific |
| record_format | marc |
| spelling | Bertsekas, Dimitri P. 1942- Verfasser (DE-588)171165519 aut Convex optimization algorithms Dimitri P. Bertsekas (Massachusetts Institute of Technology) Belmont, Massachusetts Athena Scientific [2015] xii, 564 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027877323&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Bertsekas, Dimitri P. 1942- Convex optimization algorithms Konvexe Optimierung (DE-588)4137027-2 gnd |
| subject_GND | (DE-588)4137027-2 |
| title | Convex optimization algorithms |
| title_auth | Convex optimization algorithms |
| title_exact_search | Convex optimization algorithms |
| title_full | Convex optimization algorithms Dimitri P. Bertsekas (Massachusetts Institute of Technology) |
| title_fullStr | Convex optimization algorithms Dimitri P. Bertsekas (Massachusetts Institute of Technology) |
| title_full_unstemmed | Convex optimization algorithms Dimitri P. Bertsekas (Massachusetts Institute of Technology) |
| title_short | Convex optimization algorithms |
| title_sort | convex optimization algorithms |
| topic | 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=027877323&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bertsekasdimitrip convexoptimizationalgorithms |