Introductory Lectures on Convex Optimization: A Basic Course
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2004
|
| Schriftenreihe: | Applied Optimization
87 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | It was in the middle of the 1980s, when the seminal paper by Karmarkar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear optimization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical prediction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and directions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly developing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. After almost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12] |
| Beschreibung: | 1 Online-Ressource (XVIII, 236 p) |
| ISBN: | 9781441988539 9781461346913 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/978-1-4419-8853-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042419308 | ||
| 003 | DE-604 | ||
| 005 | 20180109 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9781441988539 |c Online |9 978-1-4419-8853-9 | ||
| 020 | |a 9781461346913 |c Print |9 978-1-4613-4691-3 | ||
| 024 | 7 | |a 10.1007/978-1-4419-8853-9 |2 doi | |
| 035 | |a (OCoLC)1184689379 | ||
| 035 | |a (DE-599)BVBBV042419308 | ||
| 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 Nesterov, Yurii |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Introductory Lectures on Convex Optimization |b A Basic Course |c by Yurii Nesterov |
| 264 | 1 | |a Boston, MA |b Springer US |c 2004 | |
| 300 | |a 1 Online-Ressource (XVIII, 236 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Applied Optimization |v 87 |x 1384-6485 | |
| 500 | |a It was in the middle of the 1980s, when the seminal paper by Karmarkar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear optimization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical prediction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and directions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly developing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. After almost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12] | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
| 689 | 0 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 830 | 0 | |a Applied Optimization |v 87 |w (DE-604)BV010841718 |9 87 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4419-8853-9 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854725 | ||
| 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_ | 1804153089786118144 |
|---|---|
| any_adam_object | |
| author | Nesterov, Yurii |
| author_facet | Nesterov, Yurii |
| author_role | aut |
| author_sort | Nesterov, Yurii |
| author_variant | y n yn |
| building | Verbundindex |
| bvnumber | BV042419308 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184689379 (DE-599)BVBBV042419308 |
| 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-4419-8853-9 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03469nmm a2200541zcb4500</leader><controlfield tag="001">BV042419308</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180109 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441988539</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4419-8853-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461346913</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-4691-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4419-8853-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184689379</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419308</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">Nesterov, Yurii</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introductory Lectures on Convex Optimization</subfield><subfield code="b">A Basic Course</subfield><subfield code="c">by Yurii Nesterov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 236 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="1" ind2=" "><subfield code="a">Applied Optimization</subfield><subfield code="v">87</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">It was in the middle of the 1980s, when the seminal paper by Karmarkar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear optimization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical prediction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and directions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly developing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. After almost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12]</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">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">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Applied Optimization</subfield><subfield code="v">87</subfield><subfield code="w">(DE-604)BV010841718</subfield><subfield code="9">87</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4419-8853-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</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-027854725</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> |
| genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV042419308 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9781441988539 9781461346913 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854725 |
| oclc_num | 1184689379 |
| 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 (XVIII, 236 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer US |
| record_format | marc |
| series | Applied Optimization |
| series2 | Applied Optimization |
| spelling | Nesterov, Yurii Verfasser aut Introductory Lectures on Convex Optimization A Basic Course by Yurii Nesterov Boston, MA Springer US 2004 1 Online-Ressource (XVIII, 236 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 87 1384-6485 It was in the middle of the 1980s, when the seminal paper by Karmarkar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear optimization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical prediction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and directions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly developing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. After almost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12] Mathematics Information theory Mathematical optimization Optimization Theory of Computation Mathematik Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Konvexe Optimierung (DE-588)4137027-2 s Berechnungskomplexität (DE-588)4134751-1 s 2\p DE-604 Applied Optimization 87 (DE-604)BV010841718 87 https://doi.org/10.1007/978-1-4419-8853-9 Verlag Volltext 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 | Nesterov, Yurii Introductory Lectures on Convex Optimization A Basic Course Applied Optimization Mathematics Information theory Mathematical optimization Optimization Theory of Computation Mathematik Berechnungskomplexität (DE-588)4134751-1 gnd Konvexe Optimierung (DE-588)4137027-2 gnd |
| subject_GND | (DE-588)4134751-1 (DE-588)4137027-2 (DE-588)4151278-9 |
| title | Introductory Lectures on Convex Optimization A Basic Course |
| title_auth | Introductory Lectures on Convex Optimization A Basic Course |
| title_exact_search | Introductory Lectures on Convex Optimization A Basic Course |
| title_full | Introductory Lectures on Convex Optimization A Basic Course by Yurii Nesterov |
| title_fullStr | Introductory Lectures on Convex Optimization A Basic Course by Yurii Nesterov |
| title_full_unstemmed | Introductory Lectures on Convex Optimization A Basic Course by Yurii Nesterov |
| title_short | Introductory Lectures on Convex Optimization |
| title_sort | introductory lectures on convex optimization a basic course |
| title_sub | A Basic Course |
| topic | Mathematics Information theory Mathematical optimization Optimization Theory of Computation Mathematik Berechnungskomplexität (DE-588)4134751-1 gnd Konvexe Optimierung (DE-588)4137027-2 gnd |
| topic_facet | Mathematics Information theory Mathematical optimization Optimization Theory of Computation Mathematik Berechnungskomplexität Konvexe Optimierung Einführung |
| url | https://doi.org/10.1007/978-1-4419-8853-9 |
| volume_link | (DE-604)BV010841718 |
| work_keys_str_mv | AT nesterovyurii introductorylecturesonconvexoptimizationabasiccourse |