Iterative methods for optimization:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
SIAM
1999
|
| Schriftenreihe: | Frontiers in applied mathematics
18 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 180 S. graph. Darst. |
| ISBN: | 0898714338 9780898714333 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012738694 | ||
| 003 | DE-604 | ||
| 005 | 20071128 | ||
| 007 | t | ||
| 008 | 990831s1999 xxud||| |||| 00||| eng d | ||
| 020 | |a 0898714338 |9 0-89871-433-8 | ||
| 020 | |a 9780898714333 |9 978-0-898714-33-3 | ||
| 035 | |a (OCoLC)40734787 | ||
| 035 | |a (DE-599)BVBBV012738694 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-29T |a DE-703 |a DE-91G |a DE-20 |a DE-355 |a DE-19 |a DE-521 |a DE-634 |a DE-706 | ||
| 050 | 0 | |a QA402.5.K44 1999 | |
| 082 | 0 | |a 519.3 |2 21 | |
| 082 | 0 | |a 519.3 21 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 084 | |a MAT 912f |2 stub | ||
| 100 | 1 | |a Kelley, C. T. |e Verfasser |0 (DE-588)114209642 |4 aut | |
| 245 | 1 | 0 | |a Iterative methods for optimization |c C. T. Kelley |
| 264 | 1 | |a Philadelphia, Pa. |b SIAM |c 1999 | |
| 300 | |a XV, 180 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Frontiers in applied mathematics |v 18 | |
| 650 | 7 | |a Iteratief oplossen |2 gtt | |
| 650 | 7 | |a Itération (mathématiques) |2 ram | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 7 | |a Optimisation mathématique |2 ram | |
| 650 | 7 | |a methode iterative |2 inriac | |
| 650 | 7 | |a optimisation mathematique |2 inriac | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Iterative methods (Mathematics) | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Iteration |0 (DE-588)4123457-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Iteration |0 (DE-588)4123457-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Frontiers in applied mathematics |v 18 |w (DE-604)BV001873790 |9 18 | |
| 856 | 4 | 2 | |m Digitalisierung UB Regensburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008662095&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008662095 | ||
Datensatz im Suchindex
| _version_ | 1804127406088257536 |
|---|---|
| adam_text | Contents
Preface
xiii
How to Get the Software
xv
I Optimization of Smooth Functions
1
1
Basic Concepts
3
1.1
The Problem
.................................... 3
1.2
Notation
...................................... 4
1.3
Necessary Conditions
............................... 5
1.4
Sufficient Conditions
............................... 6
1.5
Quadratic Objective Functions
.......................... 6
1.5.1
Positive Definite Hessian
......................... 7
1.5.2
Indefinite Hessian
............................. 9
1.6
Examples
..................................... 9
1.6.1
Discrete Optimal Control
......................... 9
1.6.2
Parameter Identification
......................... 11
1.6.3
Convex Quadratics
............................ 12
1.7
Exercises on Basic Concepts
........................... 12
2
Local Convergence of Newton s Method
13
2.1
Types of Convergence
............................... 13
2.2
The Standard Assumptions
............................ 14
2.3
Newton s Method
................................. 14
2.3.1
Errors in Functions, Gradients, and Hessians
.............. 17
2.3.2
Termination of the Iteration
....................... 21
2.4
Nonlinear Least Squares
............................. 22
2.4.1
Gauss-Newton Iteration
......................... 23
2.4.2
Overdetermined Problems
........................ 24
2.4.3
Underdetermined Problems
....................... 25
2.5
Inexact Newton Methods
............................. 28
2.5.1
Convergence Rates
............................ 29
2.5.2
Implementation of Newton-CG
..................... 30
2.6
Examples
..................................... 33
2.6.1
Parameter Identification
......................... 33
2.6.2
Discrete Control Problem
........................ 34
2.7
Exercises on Local Convergence
......................... 35
ix
x
CONTENTS
3 Global
Convergence
39
3.1
The Method of Steepest
Descent
......................... 39
3.2
Line Search Methods and the
Armijo
Rule
.................... 40
3.2.1
Stepsize Control with Polynomial Models
................ 43
3.2.2
Slow Convergence of Steepest Descent
................. 45
3.2.3
Damped Gauss-Newton Iteration
.................... 47
3.2.4
Nonlinear Conjugate Gradient Methods
................. 48
3.3
Trust Region Methods
............................... 50
3.3.1
Changing the Trust Region and the Step
................. 51
3.3.2
Global Convergence of Trust Region Algorithms
............ 52
3.3.3
A Unidirectional Trust Region Algorithm
................ 54
3.3.4
The Exact Solution of the Trust Region Problem
............ 55
3.3.5
The Levenberg-Marquardt Parameter
.................. 56
3.3.6 Superlinear
Convergence: The Dogleg
.................. 58
3.3.7
A Trust Region Method for Newton-CG
................. 63
3.4
Examples
..................................... 65
3.4.1
Parameter Identification
......................... 67
3.4.2
Discrete Control Problem
........................ 68
3.5
Exercises on Global Convergence
........................ 68
4
The BFGS Method
71
4.1
Analysis
...................................... 72
4.1.1
Local Theory
............................... 72
4.1.2
Global Theory
.............................. 77
4.2
Implementation
.................................. 78
4.2.1
Storage
.................................. 78
4.2.2
A BFGS-Armijo Algorithm
....................... 80
4.3
Other
Quasi-Newton
Methods
.......................... 81
4.4
Examples
..................................... 83
4.4.1
Parameter ID Problem
.......................... 83
4.4.2
Discrete Control Problem
........................ 83
4.5
Exercises on BFGS
................................ 85
5
Simple Bound Constraints
87
5.1
Problem Statement
................................ 87
5.2
Necessary Conditions for Optimality
....................... 87
5.3
Sufficient Conditions
............................... 89
5.4
The Gradient Projection Algorithm
........................ 91
5.4.1
Termination of the Iteration
....................... 91
5.4.2
Convergence Analysis
.......................... 93
5.4.3
Identification of the Active Set
...................... 95
5.4.4
A Proof of Theorem
5.2.4 ........................ 96
5.5 Superlinear
Convergence
............................. 96
5.5.1
The Scaled Gradient Projection Algorithm
................ 96
5.5.2
The Projected Newton Method
...................... 100
5.5.3
A Projected BFGS-Armijo Algorithm
.................. 102
5.6
Other Approaches
................................. 104
5.6.1
Infinite-Dimensional Problems
...................... 106
5.7
Examples
..................................... 106
5.7.1
Parameter ID Problem
.......................... 106
5.7.2
Discrete Control Problem
........................ 106
CONTENTS xi
5.8
Exercises on
Bound Constrained Optimization
.................. 108
II Optimization of Noisy Functions
109
6
Basic Concepts and Goals 111
6.1
Problem Statement
................................ 112
6.2
The Simplex Gradient
............................... 112
6.2.1
Forward Difference Simplex Gradient
.................. 113
6.2.2
Centered Difference Simplex Gradient
.................. 115
6.3
Examples
..................................... 118
6.3.1
Weber s Problem
............................. 118
6.3.2
Perturbed Convex Quadratics
...................... 119
6.3.3
Lennard-Jones Problem
......................... 120
6.4
Exercises on Basic Concepts
........................... 121
7
Implicit Filtering
123
7.1
Description and Analysis of Implicit Filtering
.................. 123
7.2
Quasi-Newton
Methods and Implicit Filtering
.................. 124
7.3
Implementation Considerations
.......................... 125
7.4
Implicit Filtering for Bound Constrained Problems
............... 126
7.5
Restarting and Minima at All Scales
....................... 127
7.6
Examples
..................................... 127
7.6.1
Weber s Problem
............................. 127
7.6.2
Parameter ID
............................... 129
7.6.3
Convex Quadratics
............................ 129
7.7
Exercises on Implicit Filtering
.......................... 133
8
Direct Search Algorithms
135
8.1
The Nelder-Mead Algorithm
........................... 135
8.1.1
Description and Implementation
..................... 135
8.1.2
Sufficient Decrease and the Simplex Gradient
.............. 137
8.1.3
MeKinnon s Examples
.......................... 139
8.1.4
Restarting the Nelder-Mead Algorithm
................. 141
8.2
Multidirectional Search
.............................. 143
8.2.1
Description and Implementation
..................... 143
8.2.2
Convergence and the Simplex Gradient
................. 144
8.3
The Hooke-Jeeves Algorithm
........................... 145
8.3.1
Description and Implementation
..................... 145
8.3.2
Convergence and the Simplex Gradient
................. 148
8.4
Other Approaches
................................. 148
8.4.1
Surrogate Models
............................. 148
8.4.2
The DIRECT Algorithm
......................... 149
8.5
Examples
..................................... 152
8.5.1
Weber s Problem
............................. 152
8.5.2
Parameter ID
............................... 153
8.5.3
Convex Quadratics
............................ 153
8.6
Exercises on Search Algorithms
......................... 159
X
CONTENTS
Bibliography
Index
|
| any_adam_object | 1 |
| author | Kelley, C. T. |
| author_GND | (DE-588)114209642 |
| author_facet | Kelley, C. T. |
| author_role | aut |
| author_sort | Kelley, C. T. |
| author_variant | c t k ct ctk |
| building | Verbundindex |
| bvnumber | BV012738694 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5.K44 1999 |
| callnumber-search | QA402.5.K44 1999 |
| callnumber-sort | QA 3402.5 K44 41999 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 870 SK 910 |
| classification_tum | MAT 912f |
| ctrlnum | (OCoLC)40734787 (DE-599)BVBBV012738694 |
| dewey-full | 519.3 519.321 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.3 519.3 21 |
| dewey-search | 519.3 519.3 21 |
| dewey-sort | 3519.3 |
| 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>02046nam a2200541 cb4500</leader><controlfield tag="001">BV012738694</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20071128 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">990831s1999 xxud||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898714338</subfield><subfield code="9">0-89871-433-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898714333</subfield><subfield code="9">978-0-898714-33-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)40734787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012738694</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5.K44 1999</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3 21</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">SK 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 912f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kelley, C. T.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)114209642</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iterative methods for optimization</subfield><subfield code="c">C. T. Kelley</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">SIAM</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 180 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="1" ind2=" "><subfield code="a">Frontiers in applied mathematics</subfield><subfield code="v">18</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Iteratief oplossen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Itération (mathématiques)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation mathématique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">methode iterative</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation mathematique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Iterative methods (Mathematics)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Frontiers in applied mathematics</subfield><subfield code="v">18</subfield><subfield code="w">(DE-604)BV001873790</subfield><subfield code="9">18</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg</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=008662095&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-008662095</subfield></datafield></record></collection> |
| id | DE-604.BV012738694 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:32:50Z |
| institution | BVB |
| isbn | 0898714338 9780898714333 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008662095 |
| oclc_num | 40734787 |
| open_access_boolean | |
| owner | DE-29T DE-703 DE-91G DE-BY-TUM DE-20 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-521 DE-634 DE-706 |
| owner_facet | DE-29T DE-703 DE-91G DE-BY-TUM DE-20 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-521 DE-634 DE-706 |
| physical | XV, 180 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | SIAM |
| record_format | marc |
| series | Frontiers in applied mathematics |
| series2 | Frontiers in applied mathematics |
| spelling | Kelley, C. T. Verfasser (DE-588)114209642 aut Iterative methods for optimization C. T. Kelley Philadelphia, Pa. SIAM 1999 XV, 180 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Frontiers in applied mathematics 18 Iteratief oplossen gtt Itération (mathématiques) ram Optimaliseren gtt Optimisation mathématique ram methode iterative inriac optimisation mathematique inriac Mathematical optimization Iterative methods (Mathematics) Optimierung (DE-588)4043664-0 gnd rswk-swf Iteration (DE-588)4123457-1 gnd rswk-swf Optimierung (DE-588)4043664-0 s Iteration (DE-588)4123457-1 s DE-604 Frontiers in applied mathematics 18 (DE-604)BV001873790 18 Digitalisierung UB Regensburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008662095&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Kelley, C. T. Iterative methods for optimization Frontiers in applied mathematics Iteratief oplossen gtt Itération (mathématiques) ram Optimaliseren gtt Optimisation mathématique ram methode iterative inriac optimisation mathematique inriac Mathematical optimization Iterative methods (Mathematics) Optimierung (DE-588)4043664-0 gnd Iteration (DE-588)4123457-1 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4123457-1 |
| title | Iterative methods for optimization |
| title_auth | Iterative methods for optimization |
| title_exact_search | Iterative methods for optimization |
| title_full | Iterative methods for optimization C. T. Kelley |
| title_fullStr | Iterative methods for optimization C. T. Kelley |
| title_full_unstemmed | Iterative methods for optimization C. T. Kelley |
| title_short | Iterative methods for optimization |
| title_sort | iterative methods for optimization |
| topic | Iteratief oplossen gtt Itération (mathématiques) ram Optimaliseren gtt Optimisation mathématique ram methode iterative inriac optimisation mathematique inriac Mathematical optimization Iterative methods (Mathematics) Optimierung (DE-588)4043664-0 gnd Iteration (DE-588)4123457-1 gnd |
| topic_facet | Iteratief oplossen Itération (mathématiques) Optimaliseren Optimisation mathématique methode iterative optimisation mathematique Mathematical optimization Iterative methods (Mathematics) Optimierung Iteration |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008662095&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV001873790 |
| work_keys_str_mv | AT kelleyct iterativemethodsforoptimization |