Interior-point polynomial algorithms in convex programming:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Philadelphia, Pa.
Soc. for Industrial and Applied Mathematics
1993
|
| Series: | SIAM studies in applied mathematics
13 |
| Subjects: | |
| Physical Description: | IX, 405 S. |
| ISBN: | 0898713196 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV022127697 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 941007s1993 |||| 00||| eng d | ||
| 020 | |a 0898713196 |9 0-89871-319-6 | ||
| 035 | |a (OCoLC)29310677 | ||
| 035 | |a (DE-599)BVBBV022127697 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA402.5 | |
| 082 | 0 | |a 519.7/6 |2 20 | |
| 100 | 1 | |a Nesterov, Jurij E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Interior-point polynomial algorithms in convex programming |c Yurii Nesterov and Arkadii Nemirovskii |
| 264 | 1 | |a Philadelphia, Pa. |b Soc. for Industrial and Applied Mathematics |c 1993 | |
| 300 | |a IX, 405 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a SIAM studies in applied mathematics |v 13 | |
| 650 | 4 | |a Convex programming | |
| 650 | 4 | |a Programming (Mathematics) | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Innerer Punkt |0 (DE-588)4336760-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematische Methode |0 (DE-588)4155620-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Innerer Punkt |0 (DE-588)4336760-4 |D s |
| 689 | 0 | 1 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 0 | 2 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 1 | 2 | |a Mathematische Methode |0 (DE-588)4155620-3 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Mathematische Methode |0 (DE-588)4155620-3 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Nemirovskij, Arkadij S. |d 1947- |e Verfasser |0 (DE-588)12209395X |4 aut | |
| 830 | 0 | |a SIAM studies in applied mathematics |v 13 |w (DE-604)BV001889480 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015342338 | ||
| 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 | |
Record in the Search Index
| _version_ | 1804136099868573696 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Nesterov, Jurij E. Nemirovskij, Arkadij S. 1947- |
| author_GND | (DE-588)12209395X |
| author_facet | Nesterov, Jurij E. Nemirovskij, Arkadij S. 1947- |
| author_role | aut aut |
| author_sort | Nesterov, Jurij E. |
| author_variant | j e n je jen a s n as asn |
| building | Verbundindex |
| bvnumber | BV022127697 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5 |
| callnumber-search | QA402.5 |
| callnumber-sort | QA 3402.5 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)29310677 (DE-599)BVBBV022127697 |
| dewey-full | 519.7/6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7/6 |
| dewey-search | 519.7/6 |
| dewey-sort | 3519.7 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02160nam a2200553zcb4500</leader><controlfield tag="001">BV022127697</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941007s1993 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898713196</subfield><subfield code="9">0-89871-319-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29310677</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022127697</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/6</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nesterov, Jurij E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Interior-point polynomial algorithms in convex programming</subfield><subfield code="c">Yurii Nesterov and Arkadii Nemirovskii</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Soc. for Industrial and Applied Mathematics</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 405 S.</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">SIAM studies in applied mathematics</subfield><subfield code="v">13</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convex programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</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="650" ind1="0" ind2="7"><subfield code="a">Innerer Punkt</subfield><subfield code="0">(DE-588)4336760-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Methode</subfield><subfield code="0">(DE-588)4155620-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Innerer Punkt</subfield><subfield code="0">(DE-588)4336760-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Mathematische Methode</subfield><subfield code="0">(DE-588)4155620-3</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="689" ind1="2" ind2="0"><subfield code="a">Mathematische Methode</subfield><subfield code="0">(DE-588)4155620-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nemirovskij, Arkadij S.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12209395X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">SIAM studies in applied mathematics</subfield><subfield code="v">13</subfield><subfield code="w">(DE-604)BV001889480</subfield><subfield code="9"></subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015342338</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.BV022127697 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:16:34Z |
| indexdate | 2024-07-09T20:51:01Z |
| institution | BVB |
| isbn | 0898713196 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015342338 |
| oclc_num | 29310677 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | IX, 405 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Soc. for Industrial and Applied Mathematics |
| record_format | marc |
| series | SIAM studies in applied mathematics |
| series2 | SIAM studies in applied mathematics |
| spelling | Nesterov, Jurij E. Verfasser aut Interior-point polynomial algorithms in convex programming Yurii Nesterov and Arkadii Nemirovskii Philadelphia, Pa. Soc. for Industrial and Applied Mathematics 1993 IX, 405 S. txt rdacontent n rdamedia nc rdacarrier SIAM studies in applied mathematics 13 Convex programming Programming (Mathematics) Algorithmus (DE-588)4001183-5 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Innerer Punkt (DE-588)4336760-4 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf Mathematische Methode (DE-588)4155620-3 gnd rswk-swf Innerer Punkt (DE-588)4336760-4 s Polynomialzeitalgorithmus (DE-588)4199652-5 s Konvexe Optimierung (DE-588)4137027-2 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s Polynom (DE-588)4046711-9 s Mathematische Methode (DE-588)4155620-3 s 2\p DE-604 DE-604 Nemirovskij, Arkadij S. 1947- Verfasser (DE-588)12209395X aut SIAM studies in applied mathematics 13 (DE-604)BV001889480 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, Jurij E. Nemirovskij, Arkadij S. 1947- Interior-point polynomial algorithms in convex programming SIAM studies in applied mathematics Convex programming Programming (Mathematics) Algorithmus (DE-588)4001183-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Innerer Punkt (DE-588)4336760-4 gnd Polynom (DE-588)4046711-9 gnd Mathematische Methode (DE-588)4155620-3 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4199652-5 (DE-588)4137027-2 (DE-588)4336760-4 (DE-588)4046711-9 (DE-588)4155620-3 |
| title | Interior-point polynomial algorithms in convex programming |
| title_auth | Interior-point polynomial algorithms in convex programming |
| title_exact_search | Interior-point polynomial algorithms in convex programming |
| title_exact_search_txtP | Interior-point polynomial algorithms in convex programming |
| title_full | Interior-point polynomial algorithms in convex programming Yurii Nesterov and Arkadii Nemirovskii |
| title_fullStr | Interior-point polynomial algorithms in convex programming Yurii Nesterov and Arkadii Nemirovskii |
| title_full_unstemmed | Interior-point polynomial algorithms in convex programming Yurii Nesterov and Arkadii Nemirovskii |
| title_short | Interior-point polynomial algorithms in convex programming |
| title_sort | interior point polynomial algorithms in convex programming |
| topic | Convex programming Programming (Mathematics) Algorithmus (DE-588)4001183-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Innerer Punkt (DE-588)4336760-4 gnd Polynom (DE-588)4046711-9 gnd Mathematische Methode (DE-588)4155620-3 gnd |
| topic_facet | Convex programming Programming (Mathematics) Algorithmus Polynomialzeitalgorithmus Konvexe Optimierung Innerer Punkt Polynom Mathematische Methode |
| volume_link | (DE-604)BV001889480 |
| work_keys_str_mv | AT nesterovjurije interiorpointpolynomialalgorithmsinconvexprogramming AT nemirovskijarkadijs interiorpointpolynomialalgorithmsinconvexprogramming |