Topics in relaxation and ellipsoidal methods:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Boston, Mass. [u.a.]
Pitman
1984
|
Ausgabe: | 1. publ. |
Schriftenreihe: | Research notes in mathematics
97 |
Schlagworte: | |
Beschreibung: | 322 S. |
ISBN: | 0273086340 |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV022029533 | ||
003 | DE-604 | ||
005 | 20070926 | ||
007 | t | ||
008 | 850726s1984 |||| 00||| eng d | ||
020 | |a 0273086340 |9 0-273-08634-0 | ||
035 | |a (OCoLC)10348974 | ||
035 | |a (DE-599)BVBBV022029533 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
050 | 0 | |a T57.74 | |
082 | 0 | |a 519.7/2 |2 19 | |
084 | |a SI 880 |0 (DE-625)143209: |2 rvk | ||
100 | 1 | |a Akgül, Mustafa |e Verfasser |4 aut | |
245 | 1 | 0 | |a Topics in relaxation and ellipsoidal methods |
250 | |a 1. publ. | ||
264 | 1 | |a Boston, Mass. [u.a.] |b Pitman |c 1984 | |
300 | |a 322 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Research notes in mathematics |v 97 | |
650 | 4 | |a Linear & convex programming - Ellipsoidal algorithms | |
650 | 7 | |a Algorithmus |2 swd | |
650 | 7 | |a Konvexe Optimierung |2 swd | |
650 | 7 | |a Lineare Optimierung |2 swd | |
650 | 4 | |a Programmation convexe | |
650 | 4 | |a Programmation linéaire | |
650 | 4 | |a Relaxation, Méthodes de (Mathématiques) | |
650 | 7 | |a Relaxationsmethode |2 swd | |
650 | 4 | |a Convex programming | |
650 | 4 | |a Linear programming | |
650 | 4 | |a Relaxation methods (Mathematics) | |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Relaxationsmethode |0 (DE-588)4451085-8 |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 Lineare Optimierung |0 (DE-588)4035816-1 |2 gnd |9 rswk-swf |
655 | 7 | |a Elliptischer Algorithmus |2 gnd |9 rswk-swf | |
655 | 7 | |a Relaxationsalgorithmus |2 gnd |9 rswk-swf | |
655 | 7 | |a Ellipsoidalgorithmus |2 gnd |9 rswk-swf | |
689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 0 | 1 | |a Ellipsoidalgorithmus |A f |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 1 | 1 | |a Relaxationsalgorithmus |A f |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
689 | 2 | 1 | |a Elliptischer Algorithmus |A f |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
689 | 3 | 1 | |a Relaxationsmethode |0 (DE-588)4451085-8 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 4 | 1 | |a Elliptischer Algorithmus |A f |
689 | 4 | |5 DE-604 | |
689 | 5 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 5 | 1 | |a Relaxationsmethode |0 (DE-588)4451085-8 |D s |
689 | 5 | |5 DE-604 | |
689 | 6 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 6 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 6 | |8 1\p |5 DE-604 | |
689 | 7 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
689 | 7 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 7 | |5 DE-604 | |
689 | 8 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 8 | 1 | |a Relaxationsmethode |0 (DE-588)4451085-8 |D s |
689 | 8 | |5 DE-604 | |
830 | 0 | |a Research notes in mathematics |v 97 |w (DE-604)BV000000039 |9 97 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015244183 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804136003622928384 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Akgül, Mustafa |
author_facet | Akgül, Mustafa |
author_role | aut |
author_sort | Akgül, Mustafa |
author_variant | m a ma |
building | Verbundindex |
bvnumber | BV022029533 |
callnumber-first | T - Technology |
callnumber-label | T57 |
callnumber-raw | T57.74 |
callnumber-search | T57.74 |
callnumber-sort | T 257.74 |
callnumber-subject | T - General Technology |
classification_rvk | SI 880 |
ctrlnum | (OCoLC)10348974 (DE-599)BVBBV022029533 |
dewey-full | 519.7/2 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.7/2 |
dewey-search | 519.7/2 |
dewey-sort | 3519.7 12 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03141nam a2200889zcb4500</leader><controlfield tag="001">BV022029533</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070926 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">850726s1984 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0273086340</subfield><subfield code="9">0-273-08634-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)10348974</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022029533</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">T57.74</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/2</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 880</subfield><subfield code="0">(DE-625)143209:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Akgül, Mustafa</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topics in relaxation and ellipsoidal methods</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, Mass. [u.a.]</subfield><subfield code="b">Pitman</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">322 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">Research notes in mathematics</subfield><subfield code="v">97</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear & convex programming - Ellipsoidal algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Konvexe Optimierung</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lineare Optimierung</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation convexe</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation linéaire</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relaxation, Méthodes de (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Relaxationsmethode</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convex programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relaxation methods (Mathematics)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</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">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Elliptischer Algorithmus</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Relaxationsalgorithmus</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Ellipsoidalgorithmus</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Ellipsoidalgorithmus</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Relaxationsalgorithmus</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><subfield code="a">Elliptischer Algorithmus</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2="1"><subfield code="a">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Elliptischer Algorithmus</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" 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="7" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="8" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="8" ind2="1"><subfield code="a">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="8" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Research notes in mathematics</subfield><subfield code="v">97</subfield><subfield code="w">(DE-604)BV000000039</subfield><subfield code="9">97</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015244183</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></record></collection> |
genre | Elliptischer Algorithmus gnd Relaxationsalgorithmus gnd Ellipsoidalgorithmus gnd |
genre_facet | Elliptischer Algorithmus Relaxationsalgorithmus Ellipsoidalgorithmus |
id | DE-604.BV022029533 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:12:33Z |
indexdate | 2024-07-09T20:49:29Z |
institution | BVB |
isbn | 0273086340 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015244183 |
oclc_num | 10348974 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 322 S. |
publishDate | 1984 |
publishDateSearch | 1984 |
publishDateSort | 1984 |
publisher | Pitman |
record_format | marc |
series | Research notes in mathematics |
series2 | Research notes in mathematics |
spelling | Akgül, Mustafa Verfasser aut Topics in relaxation and ellipsoidal methods 1. publ. Boston, Mass. [u.a.] Pitman 1984 322 S. txt rdacontent n rdamedia nc rdacarrier Research notes in mathematics 97 Linear & convex programming - Ellipsoidal algorithms Algorithmus swd Konvexe Optimierung swd Lineare Optimierung swd Programmation convexe Programmation linéaire Relaxation, Méthodes de (Mathématiques) Relaxationsmethode swd Convex programming Linear programming Relaxation methods (Mathematics) Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Relaxationsmethode (DE-588)4451085-8 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Elliptischer Algorithmus gnd rswk-swf Relaxationsalgorithmus gnd rswk-swf Ellipsoidalgorithmus gnd rswk-swf Optimierung (DE-588)4043664-0 s Ellipsoidalgorithmus f DE-604 Relaxationsalgorithmus f Konvexe Optimierung (DE-588)4137027-2 s Elliptischer Algorithmus f Relaxationsmethode (DE-588)4451085-8 s Lineare Optimierung (DE-588)4035816-1 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Research notes in mathematics 97 (DE-604)BV000000039 97 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Akgül, Mustafa Topics in relaxation and ellipsoidal methods Research notes in mathematics Linear & convex programming - Ellipsoidal algorithms Algorithmus swd Konvexe Optimierung swd Lineare Optimierung swd Programmation convexe Programmation linéaire Relaxation, Méthodes de (Mathématiques) Relaxationsmethode swd Convex programming Linear programming Relaxation methods (Mathematics) Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Relaxationsmethode (DE-588)4451085-8 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Lineare Optimierung (DE-588)4035816-1 gnd |
subject_GND | (DE-588)4043664-0 (DE-588)4001183-5 (DE-588)4451085-8 (DE-588)4137027-2 (DE-588)4035816-1 |
title | Topics in relaxation and ellipsoidal methods |
title_auth | Topics in relaxation and ellipsoidal methods |
title_exact_search | Topics in relaxation and ellipsoidal methods |
title_exact_search_txtP | Topics in relaxation and ellipsoidal methods |
title_full | Topics in relaxation and ellipsoidal methods |
title_fullStr | Topics in relaxation and ellipsoidal methods |
title_full_unstemmed | Topics in relaxation and ellipsoidal methods |
title_short | Topics in relaxation and ellipsoidal methods |
title_sort | topics in relaxation and ellipsoidal methods |
topic | Linear & convex programming - Ellipsoidal algorithms Algorithmus swd Konvexe Optimierung swd Lineare Optimierung swd Programmation convexe Programmation linéaire Relaxation, Méthodes de (Mathématiques) Relaxationsmethode swd Convex programming Linear programming Relaxation methods (Mathematics) Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Relaxationsmethode (DE-588)4451085-8 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Lineare Optimierung (DE-588)4035816-1 gnd |
topic_facet | Linear & convex programming - Ellipsoidal algorithms Algorithmus Konvexe Optimierung Lineare Optimierung Programmation convexe Programmation linéaire Relaxation, Méthodes de (Mathématiques) Relaxationsmethode Convex programming Linear programming Relaxation methods (Mathematics) Optimierung Elliptischer Algorithmus Relaxationsalgorithmus Ellipsoidalgorithmus |
volume_link | (DE-604)BV000000039 |
work_keys_str_mv | AT akgulmustafa topicsinrelaxationandellipsoidalmethods |