Nonlinear Programming and Variational Inequality Problems: A Unified Approach
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1999
|
| Schriftenreihe: | Applied Optimization
23 |
| Schlagworte: | |
| Online-Zugang: | Volltext Inhaltsverzeichnis |
| Beschreibung: | Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement |
| Beschreibung: | 1 Online-Ressource (XIV, 336 p) |
| ISBN: | 9781475729917 9781441948069 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/978-1-4757-2991-7 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421407 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1999 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475729917 |c Online |9 978-1-4757-2991-7 | ||
| 020 | |a 9781441948069 |c Print |9 978-1-4419-4806-9 | ||
| 024 | 7 | |a 10.1007/978-1-4757-2991-7 |2 doi | |
| 035 | |a (OCoLC)1184487391 | ||
| 035 | |a (DE-599)BVBBV042421407 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 519.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Patriksson, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Nonlinear Programming and Variational Inequality Problems |b A Unified Approach |c by Michael Patriksson |
| 264 | 1 | |a Boston, MA |b Springer US |c 1999 | |
| 300 | |a 1 Online-Ressource (XIV, 336 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied Optimization |v 23 |x 1384-6485 | |
| 500 | |a Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Computational Mathematics and Numerical Analysis | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Operations Research, Management Science | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Variationsungleichung |0 (DE-588)4187420-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
| 689 | 0 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Variationsungleichung |0 (DE-588)4187420-1 |D s |
| 689 | 1 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-2991-7 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027856824&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856824 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153094429212672 |
|---|---|
| adam_text | INHALT
VON
SCHAFEN
UND
MENSCHEN
5
WIR
HABEN
WAS
GEHOERT
II
WIR
BRAUCHEN
EINEN
PLAN
18
WENN
JEMAND
DAS
SCHAFFT,
DANN
CHARLOTTE!
2-4
CHARLOTTE,
DAS
BIN
ICH
3I
NIFTS!
38
GENAUUUUE!
47
ROSIS
VERDACHT
55
NOCH
FRAGEN?
66
WOELFE...
73
DA
GIBT
*
S
EIN
PAAR
SACHEN
...
80
KRAEUTLEIN
FUER
KRAEUTLEIN,
GEDANKE
FUER
GEDANKE
86
VOLLMOND
9I
PSSSSST!
99
DU
DENKST
DOCH
NICHT
...?
105
DIE
RACHE
109
HIMMELHERRSCHAFTSZEITEN,
RUHE
!
116
KEINE
CHANCE
120
VERSUCH
*
S
ERST
GAR
NICHT
ZU
VERSTEHEN!
124
EIN
KUESSCHEN
FUER
EDUARD
127
MENSCHEN
EBEN!
130
WENN
ICH
EIN
MAEDCHEN
WAERE
...
136
UND
DIE
WOELFE?
138
UND
DIE
WETTEN
?
139
|
| any_adam_object | 1 |
| author | Patriksson, Michael |
| author_facet | Patriksson, Michael |
| author_role | aut |
| author_sort | Patriksson, Michael |
| author_variant | m p mp |
| building | Verbundindex |
| bvnumber | BV042421407 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184487391 (DE-599)BVBBV042421407 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4757-2991-7 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03983nmm a2200637zcb4500</leader><controlfield tag="001">BV042421407</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1999 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475729917</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-2991-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441948069</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4806-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-2991-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184487391</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421407</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Patriksson, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nonlinear Programming and Variational Inequality Problems</subfield><subfield code="b">A Unified Approach</subfield><subfield code="c">by Michael Patriksson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 336 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Applied Optimization</subfield><subfield code="v">23</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research, Management Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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">Variationsungleichung</subfield><subfield code="0">(DE-588)4187420-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Variationsungleichung</subfield><subfield code="0">(DE-588)4187420-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-2991-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=027856824&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856824</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042421407 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:08Z |
| institution | BVB |
| isbn | 9781475729917 9781441948069 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856824 |
| oclc_num | 1184487391 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIV, 336 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Springer US |
| record_format | marc |
| series2 | Applied Optimization |
| spelling | Patriksson, Michael Verfasser aut Nonlinear Programming and Variational Inequality Problems A Unified Approach by Michael Patriksson Boston, MA Springer US 1999 1 Online-Ressource (XIV, 336 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 23 1384-6485 Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement Mathematics Information theory Computer science / Mathematics Algorithms Mathematical optimization Optimization Computational Mathematics and Numerical Analysis Theory of Computation Operations Research, Management Science Informatik Mathematik Nichtlineare Optimierung (DE-588)4128192-5 gnd rswk-swf Variationsungleichung (DE-588)4187420-1 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Nichtlineare Optimierung (DE-588)4128192-5 s Approximation (DE-588)4002498-2 s 1\p DE-604 Variationsungleichung (DE-588)4187420-1 s 2\p DE-604 https://doi.org/10.1007/978-1-4757-2991-7 Verlag Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027856824&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Patriksson, Michael Nonlinear Programming and Variational Inequality Problems A Unified Approach Mathematics Information theory Computer science / Mathematics Algorithms Mathematical optimization Optimization Computational Mathematics and Numerical Analysis Theory of Computation Operations Research, Management Science Informatik Mathematik Nichtlineare Optimierung (DE-588)4128192-5 gnd Variationsungleichung (DE-588)4187420-1 gnd Approximation (DE-588)4002498-2 gnd |
| subject_GND | (DE-588)4128192-5 (DE-588)4187420-1 (DE-588)4002498-2 |
| title | Nonlinear Programming and Variational Inequality Problems A Unified Approach |
| title_auth | Nonlinear Programming and Variational Inequality Problems A Unified Approach |
| title_exact_search | Nonlinear Programming and Variational Inequality Problems A Unified Approach |
| title_full | Nonlinear Programming and Variational Inequality Problems A Unified Approach by Michael Patriksson |
| title_fullStr | Nonlinear Programming and Variational Inequality Problems A Unified Approach by Michael Patriksson |
| title_full_unstemmed | Nonlinear Programming and Variational Inequality Problems A Unified Approach by Michael Patriksson |
| title_short | Nonlinear Programming and Variational Inequality Problems |
| title_sort | nonlinear programming and variational inequality problems a unified approach |
| title_sub | A Unified Approach |
| topic | Mathematics Information theory Computer science / Mathematics Algorithms Mathematical optimization Optimization Computational Mathematics and Numerical Analysis Theory of Computation Operations Research, Management Science Informatik Mathematik Nichtlineare Optimierung (DE-588)4128192-5 gnd Variationsungleichung (DE-588)4187420-1 gnd Approximation (DE-588)4002498-2 gnd |
| topic_facet | Mathematics Information theory Computer science / Mathematics Algorithms Mathematical optimization Optimization Computational Mathematics and Numerical Analysis Theory of Computation Operations Research, Management Science Informatik Mathematik Nichtlineare Optimierung Variationsungleichung Approximation |
| url | https://doi.org/10.1007/978-1-4757-2991-7 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027856824&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT patrikssonmichael nonlinearprogrammingandvariationalinequalityproblemsaunifiedapproach |