Nonlinear programming: sequential unconstrained minimization techniques
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics
1990
|
Schriftenreihe: | Classics in applied mathematics
4 |
Schlagworte: | |
Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 196-201) and indexes Chapter 1. Introduction -- Chapter 2. Mathematical programming theory -- Chapter 3. Interior point unconstrained minimization techniques -- Chapter 4. Exterior point unconstrained minimization techniques -- Chapter 5. Extrapolation in unconstrained minimization techniques -- Chapter 6. Convex programming -- Chapter 7. Other unconstrained minimization techniques -- Chapter 8. Computational aspects of unconstrained minimization algorithms -- Author index -- Subject index Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them |
Beschreibung: | 1 Online-Ressource (xvi, 210 Seiten) |
ISBN: | 0898712548 9780898712544 |
DOI: | 10.1137/1.9781611971316 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV039747304 | ||
003 | DE-604 | ||
005 | 20210210 | ||
007 | cr|uuu---uuuuu | ||
008 | 111207s1990 sz |||| o||u| ||||||eng d | ||
010 | |a 90009658 | ||
020 | |a 0898712548 |c pbk. |9 0898712548 | ||
020 | |a 9780898712544 |c pbk. |9 9780898712544 | ||
024 | 7 | |a 10.1137/1.9781611971316 |2 doi | |
035 | |a (OCoLC)873886439 | ||
035 | |a (DE-599)BVBBV039747304 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a sz |c XA-CH | ||
049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
100 | 1 | |a Fiacco, Anthony V. |d 1928-2013 |e Verfasser |0 (DE-588)118109189 |4 aut | |
245 | 1 | 0 | |a Nonlinear programming |b sequential unconstrained minimization techniques |c Anthony V. Fiacco, Garth P. McCormick |
264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics |c 1990 | |
300 | |a 1 Online-Ressource (xvi, 210 Seiten) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Classics in applied mathematics |v 4 | |
500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
500 | |a Includes bibliographical references (s. 196-201) and indexes | ||
500 | |a Chapter 1. Introduction -- Chapter 2. Mathematical programming theory -- Chapter 3. Interior point unconstrained minimization techniques -- Chapter 4. Exterior point unconstrained minimization techniques -- Chapter 5. Extrapolation in unconstrained minimization techniques -- Chapter 6. Convex programming -- Chapter 7. Other unconstrained minimization techniques -- Chapter 8. Computational aspects of unconstrained minimization algorithms -- Author index -- Subject index | ||
500 | |a Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them | ||
650 | 4 | |a Nonlinear programming | |
650 | 4 | |a Mathematical optimization | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a MacCormick, Garth P. |e Sonstige |0 (DE-588)171146492 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0898712548 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 9780898712544 |
830 | 0 | |a Classics in applied mathematics |v 4 |w (DE-604)BV040633091 |9 4 | |
856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611971316 |x Verlag |3 Volltext |
912 | |a ZDB-72-SIA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-024594835 | ||
966 | e | |u https://doi.org/10.1137/1.9781611971316 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611971316 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611971316 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611971316 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804148637590093824 |
---|---|
any_adam_object | |
author | Fiacco, Anthony V. 1928-2013 |
author_GND | (DE-588)118109189 (DE-588)171146492 |
author_facet | Fiacco, Anthony V. 1928-2013 |
author_role | aut |
author_sort | Fiacco, Anthony V. 1928-2013 |
author_variant | a v f av avf |
building | Verbundindex |
bvnumber | BV039747304 |
classification_rvk | SK 870 |
collection | ZDB-72-SIA |
ctrlnum | (OCoLC)873886439 (DE-599)BVBBV039747304 |
discipline | Mathematik |
doi_str_mv | 10.1137/1.9781611971316 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03507nmm a2200565zcb4500</leader><controlfield tag="001">BV039747304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210210 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s1990 sz |||| o||u| ||||||eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">90009658</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898712548</subfield><subfield code="c">pbk.</subfield><subfield code="9">0898712548</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898712544</subfield><subfield code="c">pbk.</subfield><subfield code="9">9780898712544</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611971316</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873886439</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747304</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="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</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">Fiacco, Anthony V.</subfield><subfield code="d">1928-2013</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118109189</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nonlinear programming</subfield><subfield code="b">sequential unconstrained minimization techniques</subfield><subfield code="c">Anthony V. Fiacco, Garth P. McCormick</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xvi, 210 Seiten)</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="1" ind2=" "><subfield code="a">Classics in applied mathematics</subfield><subfield code="v">4</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (s. 196-201) and indexes</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Chapter 1. Introduction -- Chapter 2. Mathematical programming theory -- Chapter 3. Interior point unconstrained minimization techniques -- Chapter 4. Exterior point unconstrained minimization techniques -- Chapter 5. Extrapolation in unconstrained minimization techniques -- Chapter 6. Convex programming -- Chapter 7. Other unconstrained minimization techniques -- Chapter 8. Computational aspects of unconstrained minimization algorithms -- Author index -- Subject index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">MacCormick, Garth P.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)171146492</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0898712548</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">9780898712544</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Classics in applied mathematics</subfield><subfield code="v">4</subfield><subfield code="w">(DE-604)BV040633091</subfield><subfield code="9">4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611971316</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594835</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971316</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971316</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971316</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611971316</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV039747304 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T00:10:18Z |
institution | BVB |
isbn | 0898712548 9780898712544 |
language | English |
lccn | 90009658 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594835 |
oclc_num | 873886439 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
physical | 1 Online-Ressource (xvi, 210 Seiten) |
psigel | ZDB-72-SIA |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Society for Industrial and Applied Mathematics |
record_format | marc |
series | Classics in applied mathematics |
series2 | Classics in applied mathematics |
spelling | Fiacco, Anthony V. 1928-2013 Verfasser (DE-588)118109189 aut Nonlinear programming sequential unconstrained minimization techniques Anthony V. Fiacco, Garth P. McCormick Philadelphia, Pa. Society for Industrial and Applied Mathematics 1990 1 Online-Ressource (xvi, 210 Seiten) txt rdacontent c rdamedia cr rdacarrier Classics in applied mathematics 4 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 196-201) and indexes Chapter 1. Introduction -- Chapter 2. Mathematical programming theory -- Chapter 3. Interior point unconstrained minimization techniques -- Chapter 4. Exterior point unconstrained minimization techniques -- Chapter 5. Extrapolation in unconstrained minimization techniques -- Chapter 6. Convex programming -- Chapter 7. Other unconstrained minimization techniques -- Chapter 8. Computational aspects of unconstrained minimization algorithms -- Author index -- Subject index Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them Nonlinear programming Mathematical optimization Algorithms Nichtlineare Optimierung (DE-588)4128192-5 gnd rswk-swf Nichtlineare Optimierung (DE-588)4128192-5 s DE-604 MacCormick, Garth P. Sonstige (DE-588)171146492 oth Erscheint auch als Druck-Ausgabe, Paperback 0898712548 Erscheint auch als Druck-Ausgabe, Paperback 9780898712544 Classics in applied mathematics 4 (DE-604)BV040633091 4 https://doi.org/10.1137/1.9781611971316 Verlag Volltext |
spellingShingle | Fiacco, Anthony V. 1928-2013 Nonlinear programming sequential unconstrained minimization techniques Classics in applied mathematics Nonlinear programming Mathematical optimization Algorithms Nichtlineare Optimierung (DE-588)4128192-5 gnd |
subject_GND | (DE-588)4128192-5 |
title | Nonlinear programming sequential unconstrained minimization techniques |
title_auth | Nonlinear programming sequential unconstrained minimization techniques |
title_exact_search | Nonlinear programming sequential unconstrained minimization techniques |
title_full | Nonlinear programming sequential unconstrained minimization techniques Anthony V. Fiacco, Garth P. McCormick |
title_fullStr | Nonlinear programming sequential unconstrained minimization techniques Anthony V. Fiacco, Garth P. McCormick |
title_full_unstemmed | Nonlinear programming sequential unconstrained minimization techniques Anthony V. Fiacco, Garth P. McCormick |
title_short | Nonlinear programming |
title_sort | nonlinear programming sequential unconstrained minimization techniques |
title_sub | sequential unconstrained minimization techniques |
topic | Nonlinear programming Mathematical optimization Algorithms Nichtlineare Optimierung (DE-588)4128192-5 gnd |
topic_facet | Nonlinear programming Mathematical optimization Algorithms Nichtlineare Optimierung |
url | https://doi.org/10.1137/1.9781611971316 |
volume_link | (DE-604)BV040633091 |
work_keys_str_mv | AT fiaccoanthonyv nonlinearprogrammingsequentialunconstrainedminimizationtechniques AT maccormickgarthp nonlinearprogrammingsequentialunconstrainedminimizationtechniques |