Nonlinear optimization with engineering applications:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin
Springer
2008
|
Ausgabe: | 1. ed. |
Schriftenreihe: | Springer optimization and its applications
19 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XVI, 280 S. Ill., graph. Darst. |
ISBN: | 9780387787220 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV023476191 | ||
003 | DE-604 | ||
005 | 20081031 | ||
007 | t | ||
008 | 080805s2008 gw ad|| |||| 00||| eng d | ||
015 | |a 08,N17,0508 |2 dnb | ||
016 | 7 | |a 988177919 |2 DE-101 | |
020 | |a 9780387787220 |c Gb. |9 978-0-387-78722-0 | ||
024 | 3 | |a 9780387787220 | |
028 | 5 | 2 | |a 11760627 |
035 | |a (OCoLC)254885767 | ||
035 | |a (DE-599)DNB988177919 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-703 |a DE-29T | ||
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
084 | |a 510 |2 sdnb | ||
100 | 1 | |a Bartholomew-Biggs, Michael C. |e Verfasser |0 (DE-588)137821816 |4 aut | |
245 | 1 | 0 | |a Nonlinear optimization with engineering applications |c Michael Bartholomew-Biggs |
250 | |a 1. ed. | ||
264 | 1 | |a Berlin |b Springer |c 2008 | |
300 | |a XVI, 280 S. |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Springer optimization and its applications |v 19 | |
650 | 0 | 7 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Technische Mathematik |0 (DE-588)4827059-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
689 | 0 | 1 | |a Technische Mathematik |0 (DE-588)4827059-3 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-0-387-78723-7 |
830 | 0 | |a Springer optimization and its applications |v 19 |w (DE-604)BV021746093 |9 19 | |
856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016658420&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016658420 |
Datensatz im Suchindex
_version_ | 1804137900279857152 |
---|---|
adam_text | NONLINEAR OPTIMIZATION WITH ENGINEERING APPLICATIONS BY MICHAEL
BARTHOLOMEW-BIGGS UNIVERSITY OF HERTFORDSHIRE, UK VA SPRINGER CONTENTS
PREFACE XI LIST OF FIGURES XIII LIST OF TABLES XV 1. INTRODUCING
OPTIMIZATION 1 1.1 A TANK DESIGN PROBLEM 1 1.2 LEAST SQUARES
DATA-FITTING 3 1.3 A ROUTING PROBLEM 7 2. ONE-VARIABLE OPTIMIZATION 11
2.1 OPTIMALITY CONDITIONS 11 2.2 THE BISECTION METHOD 12 2.3 THE SECANT
METHOD 16 2.4 THE NEWTON METHOD 18 2.5 SAMPLE APPLICATIONS AND RESULTS
24 3. APPLICATIONS IN N VARIABLES 33 3.1 DATA-FITTING PROBLEMS 33 3.2
THE ROUTING PROBLEM 36 3.3 AN OPTIMAL CONTROL PROBLEM 38 4. N- VARIABLE
UNCONSTRAINED OPTIMIZATION 41 4.1 OPTIMALITY CONDITIONS 41 4.2
VISUALISING PROBLEMS IN SEVERAL VARIABLES 43 4.3 OPTIMIZATION SOFTWARE
AND TEST PROBLEMS 45 5. DIRECT SEARCH METHODS 53 5.1 UNIVARIATE SEARCH
53 VI CONTENTS 5.2 THE NELDER AND MEAD SIMPLEX METHOD 55 5.3 DIRECT 58
5.4 RESULTS WITH DIRECT SEARCH METHODS 60 6. COMPUTING DERIVATIVES 63
6.1 HAND-CRAFTED DERIVATIVES 63 6.2 FINITE DIFFERENCE ESTIMATES OF
DERIVATIVES 66 6.3 AUTOMATIC DIFFERENTIATION 68 6.4 COMPUTATIONAL COSTS
OF DERIVATIVES 72 7. THE STEEPEST DESCENT METHOD 75 7.1 INTRODUCTION 75
7.2 LINE SEARCHES 76 7.3 CONVERGENCE OF THE STEEPEST DESCENT METHOD 78
7.4 RESULTS WITH STEEPEST DESCENT 81 8. WEAK LINE SEARCHES AND
CONVERGENCE 83 8.1 WOLFE S CONVERGENCE THEOREM 83 8.2 THE ARMIJO LINE
SEARCH 86 8.3 FURTHER RESULTS WITH STEEPEST DESCENT 87 9. NEWTON AND
NEWTON-LIKE METHODS 91 9.1 QUADRATIC MODELS AND THE NEWTON STEP 91 9.2
NEWTON METHOD ADVANTAGES AND DRAWBACKS 96 9.3 SEARCH DIRECTIONS FROM
INDEFINITE HESSIANS 97 9.4 RESULTS WITH THE NEWTON METHOD 100 9.5 THE
GAUSS-NEWTON METHOD 103 9.6 RESULTS WITH THE GAUSS-NEWTON METHOD 105 10.
QUASI-NEWTON METHODS 107 10.1 APPROXIMATE SECOND-DERIVATIVE INFORMATION
107 10.2 RANK-TWO UPDATES FOR THE INVERSE HESSIAN 108 10.3 CONVERGENCE
OF QUASI-NEWTON METHODS 112 10.4 RESULTS WITH QUASI-NEWTON METHODS 113
10.5 SOME FURTHER UPDATING FORMULAE { 115 11. CONJUGATE GRADIENT METHODS
119 11.1 CONJUGATE GRADIENTS FOR A QUADRATIC Q(X) 119 11.2 CONJUGATE
GRADIENTS AND GENERAL FUNCTIONS 124 CONTENTS VII 11.3 CONVERGENCE OF
CONJUGATE GRADIENT METHODS 126 11.4 RESULTS WITH CONJUGATE GRADIENTS 127
11.5 THE TRUNCATED NEWTON METHOD 129 12. A SUMMARY OF UNCONSTRAINED
METHODS 131 13. OPTIMIZATION WITH RESTRICTIONS 133 13.1 EXCLUDING
NEGATIVE VARIABLES 133 13.2 THE PREVENTIVE MAINTENANCE PROBLEM 135 14.
LARGER-SCALE PROBLEMS 141 14.1 CONTROL PROBLEMS WITH MANY TIME STEPS 141
14.2 OVERHEAD COSTS AND RUNTIMES 143 15. GLOBAL UNCONSTRAINED
OPTIMIZATION 147 15.1 MULTISTART METHODS 148 15.2 GLOBAL SOLUTION OF
ROUTING PROBLEMS 149 15.3 GLOBAL SOLUTION OF A FEED-BLENDING PROBLEM 150
15.4 GLOBAL SOLUTION OF A SENSITIVITY PROBLEM 153 16. EQUALITY
CONSTRAINED OPTIMIZATION 155 16.1 PROBLEMS WITH EQUALITY CONSTRAINTS 155
16.2 OPTIMALITY CONDITIONS 158 16.3 A WORKED EXAMPLE 161 16.4
INTERPRETATION OF LAGRANGE MULTIPLIERS 162 16.5 SOME EXAMPLE PROBLEMS
164 17. LINEAR EQUALITY CONSTRAINTS 169 17.1 QUADRATIC PROGRAMMING 169
17.2 SAMPLE EQP SOLUTIONS 170 17.3 REDUCED-GRADIENT METHODS 172 17.4
RESULTS WITH A REDUCED-GRADIENT METHOD 179 17.5 PROJECTED-GRADIENT
METHODS 180 18. PENALTY FUNCTION METHODS 183 18.1 INTRODUCTION / 183
18.2 PENALTY FUNCTIONS 185 18.3 THE AUGMENTED LAGRANGIAN 189 18.4
RESULTS WITH P-SUMT AND AL-SUMT 192 VIII CONTENTS 18.5 EXACT PENALTY
FUNCTIONS 195 19. SEQUENTIAL QUADRATIC PROGRAMMING 197 19.1
QUADRATIC/LINEAR MODELS 197 19.2 SQP METHODS BASED ON PENALTY FUNCTIONS
200 19.3 RESULTS WITH AL-SQP 205 19.4 SQP LINE SEARCHES AND THE MARATOS
EFFECT 208 20. INEQUALITY CONSTRAINED OPTIMIZATION 211 20.1 PROBLEMS
WITH INEQUALITY CONSTRAINTS 211 20.2 OPTIMALITY CONDITIONS 216 20.3
TRANSFORMING INEQUALITIES TO EQUALITIES 220 20.4 TRANSFORMING
INEQUALITIES TO SIMPLE BOUNDS 221 20.5 EXAMPLE PROBLEMS 221 21.
EXTENDING EQUALITY CONSTRAINT METHODS 225 21.1 QUADRATIC PROGRAMMING
WITH INEQUALITIES 225 21.2 REDUCED-GRADIENTS FOR INEQUALITY CONSTRAINTS
229 21.3 PENALTY FUNCTIONS FOR INEQUALITY CONSTRAINTS 231 21.4 AL-SUMT
FOR INEQUALITY CONSTRAINTS 233 21.5 SQP FOR INEQUALITY CONSTRAINTS 234
21.6 RESULTS WITH P-SUMT, AL-SUMT AND AL-SQP 235 22. BARRIER FUNCTION
METHODS 239 22.1 PROBLEMS WITH INEQUALITY CONSTRAINTS ONLY 239 22.2
BARRIER FUNCTIONS 241 22.3 RESULTS WITH B-SUMT 244 23. INTERIOR POINT
METHODS 249 23.1 FORMING THE TRANSFORMED PROBLEM B-NLP 249 23.2
APPROXIMATE SOLUTIONS OF PROBLEM B-NLP 250 23.3 AN INTERIOR POINT
ALGORITHM 254 23.4 RESULTS WITH IPM 256 24. A SUMMARY OF CONSTRAINED
METHOD^ 259 25. THE OPTIMA SOFTWARE 261 25.1 ACCESSING OPTIMA 261 25.2
RUNNING OPTIMA 262 CONTENTS IX 25.3 MODIFYING AND CREATING TEST PROBLEMS
262 25.4 MODIFYING OPTIMIZATION METHODS 271 REFERENCES 273 INDEX 27 7
|
adam_txt |
NONLINEAR OPTIMIZATION WITH ENGINEERING APPLICATIONS BY MICHAEL
BARTHOLOMEW-BIGGS UNIVERSITY OF HERTFORDSHIRE, UK VA SPRINGER CONTENTS
PREFACE XI LIST OF FIGURES XIII LIST OF TABLES XV 1. INTRODUCING
OPTIMIZATION 1 1.1 A TANK DESIGN PROBLEM 1 1.2 LEAST SQUARES
DATA-FITTING 3 1.3 A ROUTING PROBLEM 7 2. ONE-VARIABLE OPTIMIZATION 11
2.1 OPTIMALITY CONDITIONS 11 2.2 THE BISECTION METHOD 12 2.3 THE SECANT
METHOD 16 2.4 THE NEWTON METHOD 18 2.5 SAMPLE APPLICATIONS AND RESULTS
24 3. APPLICATIONS IN N VARIABLES 33 3.1 DATA-FITTING PROBLEMS 33 3.2
THE ROUTING PROBLEM 36 3.3 AN OPTIMAL CONTROL PROBLEM 38 4. N- VARIABLE
UNCONSTRAINED OPTIMIZATION 41 4.1 OPTIMALITY CONDITIONS 41 4.2
VISUALISING PROBLEMS IN SEVERAL VARIABLES 43 4.3 OPTIMIZATION SOFTWARE
AND TEST PROBLEMS 45 5. DIRECT SEARCH METHODS 53 5.1 UNIVARIATE SEARCH
53 VI CONTENTS 5.2 THE NELDER AND MEAD SIMPLEX METHOD 55 5.3 DIRECT 58
5.4 RESULTS WITH DIRECT SEARCH METHODS 60 6. COMPUTING DERIVATIVES 63
6.1 HAND-CRAFTED DERIVATIVES 63 6.2 FINITE DIFFERENCE ESTIMATES OF
DERIVATIVES 66 6.3 AUTOMATIC DIFFERENTIATION 68 6.4 COMPUTATIONAL COSTS
OF DERIVATIVES 72 7. THE STEEPEST DESCENT METHOD 75 7.1 INTRODUCTION 75
7.2 LINE SEARCHES 76 7.3 CONVERGENCE OF THE STEEPEST DESCENT METHOD 78
7.4 RESULTS WITH STEEPEST DESCENT 81 8. WEAK LINE SEARCHES AND
CONVERGENCE 83 8.1 WOLFE'S CONVERGENCE THEOREM 83 8.2 THE ARMIJO LINE
SEARCH 86 8.3 FURTHER RESULTS WITH STEEPEST DESCENT 87 9. NEWTON AND
NEWTON-LIKE METHODS 91 9.1 QUADRATIC MODELS AND THE NEWTON STEP 91 9.2
NEWTON METHOD ADVANTAGES AND DRAWBACKS 96 9.3 SEARCH DIRECTIONS FROM
INDEFINITE HESSIANS 97 9.4 RESULTS WITH THE NEWTON METHOD 100 9.5 THE
GAUSS-NEWTON METHOD 103 9.6 RESULTS WITH THE GAUSS-NEWTON METHOD 105 10.
QUASI-NEWTON METHODS 107 10.1 APPROXIMATE SECOND-DERIVATIVE INFORMATION
107 10.2 RANK-TWO UPDATES FOR THE INVERSE HESSIAN 108 10.3 CONVERGENCE
OF QUASI-NEWTON METHODS 112 10.4 RESULTS WITH QUASI-NEWTON METHODS 113
10.5 SOME FURTHER UPDATING FORMULAE { 115 11. CONJUGATE GRADIENT METHODS
119 11.1 CONJUGATE GRADIENTS FOR A QUADRATIC Q(X) 119 11.2 CONJUGATE
GRADIENTS AND GENERAL FUNCTIONS 124 CONTENTS VII 11.3 CONVERGENCE OF
CONJUGATE GRADIENT METHODS 126 11.4 RESULTS WITH CONJUGATE GRADIENTS 127
11.5 THE TRUNCATED NEWTON METHOD 129 12. A SUMMARY OF UNCONSTRAINED
METHODS 131 13. OPTIMIZATION WITH RESTRICTIONS 133 13.1 EXCLUDING
NEGATIVE VARIABLES 133 13.2 THE PREVENTIVE MAINTENANCE PROBLEM 135 14.
LARGER-SCALE PROBLEMS 141 14.1 CONTROL PROBLEMS WITH MANY TIME STEPS 141
14.2 OVERHEAD COSTS AND RUNTIMES 143 15. GLOBAL UNCONSTRAINED
OPTIMIZATION 147 15.1 MULTISTART METHODS 148 15.2 GLOBAL SOLUTION OF
ROUTING PROBLEMS 149 15.3 GLOBAL SOLUTION OF A FEED-BLENDING PROBLEM 150
15.4 GLOBAL SOLUTION OF A SENSITIVITY PROBLEM 153 16. EQUALITY
CONSTRAINED OPTIMIZATION 155 16.1 PROBLEMS WITH EQUALITY CONSTRAINTS 155
16.2 OPTIMALITY CONDITIONS 158 16.3 A WORKED EXAMPLE 161 16.4
INTERPRETATION OF LAGRANGE MULTIPLIERS 162 16.5 SOME EXAMPLE PROBLEMS
164 17. LINEAR EQUALITY CONSTRAINTS 169 17.1 QUADRATIC PROGRAMMING 169
17.2 SAMPLE EQP SOLUTIONS 170 17.3 REDUCED-GRADIENT METHODS 172 17.4
RESULTS WITH A REDUCED-GRADIENT METHOD 179 17.5 PROJECTED-GRADIENT
METHODS 180 18. PENALTY FUNCTION METHODS 183 18.1 INTRODUCTION / 183
18.2 PENALTY FUNCTIONS 185 18.3 THE AUGMENTED LAGRANGIAN 189 18.4
RESULTS WITH P-SUMT AND AL-SUMT 192 VIII CONTENTS 18.5 EXACT PENALTY
FUNCTIONS 195 19. SEQUENTIAL QUADRATIC PROGRAMMING 197 19.1
QUADRATIC/LINEAR MODELS 197 19.2 SQP METHODS BASED ON PENALTY FUNCTIONS
200 19.3 RESULTS WITH AL-SQP 205 19.4 SQP LINE SEARCHES AND THE MARATOS
EFFECT 208 20. INEQUALITY CONSTRAINED OPTIMIZATION 211 20.1 PROBLEMS
WITH INEQUALITY CONSTRAINTS 211 20.2 OPTIMALITY CONDITIONS 216 20.3
TRANSFORMING INEQUALITIES TO EQUALITIES 220 20.4 TRANSFORMING
INEQUALITIES TO SIMPLE BOUNDS 221 20.5 EXAMPLE PROBLEMS 221 21.
EXTENDING EQUALITY CONSTRAINT METHODS 225 21.1 QUADRATIC PROGRAMMING
WITH INEQUALITIES 225 21.2 REDUCED-GRADIENTS FOR INEQUALITY CONSTRAINTS
229 21.3 PENALTY FUNCTIONS FOR INEQUALITY CONSTRAINTS 231 21.4 AL-SUMT
FOR INEQUALITY CONSTRAINTS 233 21.5 SQP FOR INEQUALITY CONSTRAINTS 234
21.6 RESULTS WITH P-SUMT, AL-SUMT AND AL-SQP 235 22. BARRIER FUNCTION
METHODS 239 22.1 PROBLEMS WITH INEQUALITY CONSTRAINTS ONLY 239 22.2
BARRIER FUNCTIONS 241 22.3 RESULTS WITH B-SUMT 244 23. INTERIOR POINT
METHODS 249 23.1 FORMING THE TRANSFORMED PROBLEM B-NLP 249 23.2
APPROXIMATE SOLUTIONS OF PROBLEM B-NLP 250 23.3 AN INTERIOR POINT
ALGORITHM 254 23.4 RESULTS WITH IPM 256 24. A SUMMARY OF CONSTRAINED
METHOD^ 259 25. THE OPTIMA SOFTWARE 261 25.1 ACCESSING OPTIMA 261 25.2
RUNNING OPTIMA 262 CONTENTS IX 25.3 MODIFYING AND CREATING TEST PROBLEMS
262 25.4 MODIFYING OPTIMIZATION METHODS 271 REFERENCES 273 INDEX 27 7 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Bartholomew-Biggs, Michael C. |
author_GND | (DE-588)137821816 |
author_facet | Bartholomew-Biggs, Michael C. |
author_role | aut |
author_sort | Bartholomew-Biggs, Michael C. |
author_variant | m c b b mcb mcbb |
building | Verbundindex |
bvnumber | BV023476191 |
classification_rvk | SK 870 |
ctrlnum | (OCoLC)254885767 (DE-599)DNB988177919 |
discipline | Mathematik |
discipline_str_mv | Mathematik |
edition | 1. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01801nam a2200457 cb4500</leader><controlfield tag="001">BV023476191</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20081031 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080805s2008 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N17,0508</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">988177919</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387787220</subfield><subfield code="c">Gb.</subfield><subfield code="9">978-0-387-78722-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780387787220</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11760627</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254885767</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB988177919</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">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</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">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bartholomew-Biggs, Michael C.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137821816</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nonlinear optimization with engineering applications</subfield><subfield code="c">Michael Bartholomew-Biggs</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 280 S.</subfield><subfield code="b">Ill., 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">Springer optimization and its applications</subfield><subfield code="v">19</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtlineare Optimierung</subfield><subfield code="0">(DE-588)4128192-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Technische Mathematik</subfield><subfield code="0">(DE-588)4827059-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nichtlineare Optimierung</subfield><subfield code="0">(DE-588)4128192-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Technische Mathematik</subfield><subfield code="0">(DE-588)4827059-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-0-387-78723-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Springer optimization and its applications</subfield><subfield code="v">19</subfield><subfield code="w">(DE-604)BV021746093</subfield><subfield code="9">19</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</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=016658420&sequence=000001&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-016658420</subfield></datafield></record></collection> |
id | DE-604.BV023476191 |
illustrated | Illustrated |
index_date | 2024-07-02T21:36:14Z |
indexdate | 2024-07-09T21:19:38Z |
institution | BVB |
isbn | 9780387787220 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016658420 |
oclc_num | 254885767 |
open_access_boolean | |
owner | DE-703 DE-29T |
owner_facet | DE-703 DE-29T |
physical | XVI, 280 S. Ill., graph. Darst. |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Springer |
record_format | marc |
series | Springer optimization and its applications |
series2 | Springer optimization and its applications |
spelling | Bartholomew-Biggs, Michael C. Verfasser (DE-588)137821816 aut Nonlinear optimization with engineering applications Michael Bartholomew-Biggs 1. ed. Berlin Springer 2008 XVI, 280 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Springer optimization and its applications 19 Nichtlineare Optimierung (DE-588)4128192-5 gnd rswk-swf Technische Mathematik (DE-588)4827059-3 gnd rswk-swf Nichtlineare Optimierung (DE-588)4128192-5 s Technische Mathematik (DE-588)4827059-3 s DE-604 Erscheint auch als Online-Ausgabe 978-0-387-78723-7 Springer optimization and its applications 19 (DE-604)BV021746093 19 HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016658420&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Bartholomew-Biggs, Michael C. Nonlinear optimization with engineering applications Springer optimization and its applications Nichtlineare Optimierung (DE-588)4128192-5 gnd Technische Mathematik (DE-588)4827059-3 gnd |
subject_GND | (DE-588)4128192-5 (DE-588)4827059-3 |
title | Nonlinear optimization with engineering applications |
title_auth | Nonlinear optimization with engineering applications |
title_exact_search | Nonlinear optimization with engineering applications |
title_exact_search_txtP | Nonlinear optimization with engineering applications |
title_full | Nonlinear optimization with engineering applications Michael Bartholomew-Biggs |
title_fullStr | Nonlinear optimization with engineering applications Michael Bartholomew-Biggs |
title_full_unstemmed | Nonlinear optimization with engineering applications Michael Bartholomew-Biggs |
title_short | Nonlinear optimization with engineering applications |
title_sort | nonlinear optimization with engineering applications |
topic | Nichtlineare Optimierung (DE-588)4128192-5 gnd Technische Mathematik (DE-588)4827059-3 gnd |
topic_facet | Nichtlineare Optimierung Technische Mathematik |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016658420&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV021746093 |
work_keys_str_mv | AT bartholomewbiggsmichaelc nonlinearoptimizationwithengineeringapplications |