Convex optimization:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2012
|
| Ausgabe: | 10. print. |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025200235&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Beschreibung: | Literaturangaben Hier auch später erschienene, unveränderte Nachdrucke |
| Umfang: | xiii, 716 Seiten Illustrationen 28cm |
| ISBN: | 9780521833783 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040346081 | ||
| 003 | DE-604 | ||
| 005 | 20230519 | ||
| 007 | t| | ||
| 008 | 120801s2012 xx a||| |||| 00||| eng d | ||
| 020 | |a 9780521833783 |c Hardback |9 978-0-521-83378-3 | ||
| 035 | |a (OCoLC)796759285 | ||
| 035 | |a (DE-599)BVBBV040346081 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 | ||
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 100 | 1 | |a Boyd, Stephen P. |d 1958- |e Verfasser |0 (DE-588)129723177 |4 aut | |
| 245 | 1 | 0 | |a Convex optimization |c Stephen Boyd, Lieven Vandenberghe |
| 250 | |a 10. print. | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
| 300 | |a xiii, 716 Seiten |b Illustrationen |c 28cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 0 | 7 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
| 689 | 0 | 1 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Vandenberghe, Lieven |d 1964- |e Verfasser |0 (DE-588)135800595 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025200235&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025200235 | |
Datensatz im Suchindex
| _version_ | 1819256201150464000 |
|---|---|
| adam_text | Contents
Preface
xi
1
Introduction
1
1.1
Mathematical optimization
........................ 1
1.2
Least-squares and linear programming
.................. 4
1.3
Convex optimization
............................ 7
1.4
Nonlinear optimization
.......................... 9
1.5
Outline
................................... 11
1.6
Notation
.................................. 14
Bibliography
................................... 16
1 Theory
19
2
Convex sets
21
2.1 Affine
and convex sets
........................... 21
2.2
Some important examples
......................... 27
2.3
Operations that preserve convexity
.................... 35
2.4
Generalized inequalities
.......................... 43
2.5
Separating and supporting
hyperplanes.................. 46
2.6
Dual cones and generalized inequalities
.................. 51
Bibliography
................................... 59
Exercises
..................................... 60
3
Convex functions
67
3.1
Basic properties and examples
...................... 67
3.2
Operations that preserve convexity
.................... 79
3.3
The conjugate function
.......................... 90
3.4
Quasiconvex functions
........................... 95
3.5
Log-concave and log-convex functions
.................. 104
3.6
Convexity with respect to generalized inequalities
............ 108
Bibliography
................................... 112
Exercises
..................................... 113
Convex
optimization problems
127
4.1
Optimization problems
.......................... 127
4.2
Convex optimization
............................ 136
4.3
Linear optimization problems
....................... 146
4.4
Quadratic optimization problems
..................... 152
4.5
Geometric programming
.......................... 160
4.6
Generalized inequality constraints
..................... 167
4.7
Vector optimization
............................ 174
Bibliography
................................... 188
Exercises
..................................... 189
Duality
215
5.1
The
Lagrange
dual function
........................ 215
5.2
The
Lagrange
dual problem
........................ 223
5.3
Geometric interpretation
......................... 232
5.4
Saddle-point interpretation
........................ 237
5.5
Optimality conditions
........................... 241
5.6
Perturbation and sensitivity analysis
................... 249
5.7
Examples
.................................. 253
5.8
Theorems of alternatives
......................... 258
5.9
Generalized inequalities
.......................... 264
Bibliography
................................... 272
Exercises
..................................... 273
Applications
289
Approximation and fitting
291
6.1
Norm approximation
............................291
6.2
Least-norm problems
...........................302
6.3
Regularized approximation
........................305
6.4
Robust approximation
...........................318
6.5
Function fitting and interpolation
.....................324
Bibliography
...................................343
Exercises
.....................................344
Statistical estimation
351
7.1
Parametric distribution estimation
....................351
7.2
Nonparametric distribution estimation
..................359
7.3
Optimal detector design and hypothesis testing
.............364
7.4
Chebyshev and Chernoff bounds
.....................374
7.5
Experiment design
.............................384
Bibliography
...................................392
Exercises
.....................................393
Geometrie
problems
397
8.1
Projection on a set
............................397
8.2
Distance between sets
...........................402
8.3
Euclidean distance and angle problems
..................405
8.4
Extremal volume ellipsoids
........................410
8.5
Centering
.................................416
8.6
Classification
................................422
8.7
Placement and location
..........................432
8.8
Floor planning
...............................438
Bibliography
...................................446
Exercises
.....................................447
III Algorithms
455
9
Unconstrained minimization
457
9.1
Unconstrained minimization problems
..................457
9.2
Descent methods
.............................463
9.3
Gradient descent method
.........................466
9.4
Steepest descent method
.........................475
9.5
Newton s method
.............................484
9.6
Self-concordance
..............................496
9.7
Implementation
..............................508
Bibliography
...................................513
Exercises
.....................................514
10
Equality constrained minimization
521
10.1
Equality constrained minimization problems
...............521
10.2
Newton s method with equality constraints
................525
10.3
Infeasible start Newton method
......................531
10.4
Implementation
..............................542
Bibliography
...................................556
Exercises
.....................................557
11
Interior-point methods
561
11.1
Inequality constrained minimization problems
..............561
11.2
Logarithmic barrier function and central path
..............562
11.3
The barrier method
............................568
11.4
Feasibility and phase I methods
......................579
11.5
Complexity analysis via self-concordance
.................585
11.6
Problems with generalized inequalities
..................596
11.7
Primal-dual interior-point methods
....................609
11.8
Implementation
..............................615
Bibliography
...................................621
Exercises
.....................................623
Appendices
631
A Mathematical background
633
A.I Norms
................................... 633
A.2 Analysis
.................................. 637
A.3 Functions
................................. 639
A.
4
Derivatives
................................. 640
A.
5
Linear algebra
............................... 645
Bibliography
................................... 652
В
Problems involving two quadratic functions
653
B.I Single constraint quadratic optimization
.................653
B.2 The S-procedure
..............................655
B.3 The field of values of two symmetric matrices
..............656
B.4 Proofs of the strong duality results
....................657
Bibliography
...................................659
С
Numerical linear algebra background
661
C.I Matrix structure and algorithm complexity
................661
C.2 Solving linear equations with factored matrices
..............664
C.3
LU, Cholesky,
and LDLT factorization
..................668
C.4 Block elimination and
Schur
complements
................672
C.5 Solving underdetermined linear equations
.................681
Bibliography
...................................684
References
685
Notation
697
Index
701
|
| any_adam_object | 1 |
| author | Boyd, Stephen P. 1958- Vandenberghe, Lieven 1964- |
| author_GND | (DE-588)129723177 (DE-588)135800595 |
| author_facet | Boyd, Stephen P. 1958- Vandenberghe, Lieven 1964- |
| author_role | aut aut |
| author_sort | Boyd, Stephen P. 1958- |
| author_variant | s p b sp spb l v lv |
| building | Verbundindex |
| bvnumber | BV040346081 |
| classification_rvk | SK 870 |
| ctrlnum | (OCoLC)796759285 (DE-599)BVBBV040346081 |
| discipline | Mathematik |
| edition | 10. print. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01620nam a2200397 c 4500</leader><controlfield tag="001">BV040346081</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230519 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">120801s2012 xx a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521833783</subfield><subfield code="c">Hardback</subfield><subfield code="9">978-0-521-83378-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)796759285</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040346081</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-739</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="100" ind1="1" ind2=" "><subfield code="a">Boyd, Stephen P.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)129723177</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convex optimization</subfield><subfield code="c">Stephen Boyd, Lieven Vandenberghe</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">10. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 716 Seiten</subfield><subfield code="b">Illustrationen</subfield><subfield code="c">28cm</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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</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="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</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="1"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</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">Vandenberghe, Lieven</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135800595</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</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=025200235&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-025200235</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV040346081 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T16:13:03Z |
| institution | BVB |
| isbn | 9780521833783 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025200235 |
| oclc_num | 796759285 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | xiii, 716 Seiten Illustrationen 28cm |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge University Press |
| record_format | marc |
| spellingShingle | Boyd, Stephen P. 1958- Vandenberghe, Lieven 1964- Convex optimization Konvexe Optimierung (DE-588)4137027-2 gnd Algorithmentheorie (DE-588)4200409-3 gnd |
| subject_GND | (DE-588)4137027-2 (DE-588)4200409-3 (DE-588)4123623-3 |
| title | Convex optimization |
| title_auth | Convex optimization |
| title_exact_search | Convex optimization |
| title_full | Convex optimization Stephen Boyd, Lieven Vandenberghe |
| title_fullStr | Convex optimization Stephen Boyd, Lieven Vandenberghe |
| title_full_unstemmed | Convex optimization Stephen Boyd, Lieven Vandenberghe |
| title_short | Convex optimization |
| title_sort | convex optimization |
| topic | Konvexe Optimierung (DE-588)4137027-2 gnd Algorithmentheorie (DE-588)4200409-3 gnd |
| topic_facet | Konvexe Optimierung Algorithmentheorie Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025200235&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT boydstephenp convexoptimization AT vandenberghelieven convexoptimization |