Interior point approach to linear, quadratic and convex programming: algorithms and complexity
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Dordrecht u.a.
Kluwer
1994
|
Schriftenreihe: | Mathematics and its applications
277 |
Schlagworte: | |
Beschreibung: | XI, 208 S. graph. Darst. |
ISBN: | 0792327349 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009598402 | ||
003 | DE-604 | ||
005 | 20180131 | ||
007 | t | ||
008 | 940518s1994 d||| m||| 00||| engod | ||
020 | |a 0792327349 |9 0-7923-2734-9 | ||
035 | |a (OCoLC)29703218 | ||
035 | |a (DE-599)BVBBV009598402 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-739 |a DE-384 |a DE-634 |a DE-11 | ||
050 | 0 | |a QA402.5 | |
082 | 0 | |a 519.7 |2 20 | |
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
100 | 1 | |a Hertog, D. den |e Verfasser |4 aut | |
245 | 1 | 0 | |a Interior point approach to linear, quadratic and convex programming |b algorithms and complexity |c by D. den Hertog |
264 | 1 | |a Dordrecht u.a. |b Kluwer |c 1994 | |
300 | |a XI, 208 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Mathematics and its applications |v 277 | |
502 | |a Zugl.: Delft, Univ., Diss., 1992 | ||
650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
650 | 7 | |a Mathematische programmering |2 gtt | |
650 | 7 | |a Programmation (mathématiques) |2 ram | |
650 | 7 | |a Programmation linéaire |2 ram | |
650 | 7 | |a algorithme point intérieur |2 inriac | |
650 | 7 | |a complexité |2 inriac | |
650 | 7 | |a programmation convexe |2 inriac | |
650 | 7 | |a programmation linéaire |2 inriac | |
650 | 7 | |a programmation quadratique |2 inriac | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Interior-point methods | |
650 | 4 | |a Linear programming | |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |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 Quadratische Optimierung |0 (DE-588)4130555-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Innere-Punkte-Methode |0 (DE-588)4352322-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Quadratische Optimierung |0 (DE-588)4130555-3 |D s |
689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Quadratische Optimierung |0 (DE-588)4130555-3 |D s |
689 | 2 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Konvexe Optimierung |0 (DE-588)4137027-2 |D s |
689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Innere-Punkte-Methode |0 (DE-588)4352322-5 |D s |
689 | 4 | |8 1\p |5 DE-604 | |
689 | 5 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 5 | |8 2\p |5 DE-604 | |
830 | 0 | |a Mathematics and its applications |v 277 |w (DE-604)BV008163334 |9 277 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006343816 | ||
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_ | 1804123939324035072 |
---|---|
any_adam_object | |
author | Hertog, D. den |
author_facet | Hertog, D. den |
author_role | aut |
author_sort | Hertog, D. den |
author_variant | d d h dd ddh |
building | Verbundindex |
bvnumber | BV009598402 |
callnumber-first | Q - Science |
callnumber-label | QA402 |
callnumber-raw | QA402.5 |
callnumber-search | QA402.5 |
callnumber-sort | QA 3402.5 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 870 |
ctrlnum | (OCoLC)29703218 (DE-599)BVBBV009598402 |
dewey-full | 519.7 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.7 |
dewey-search | 519.7 |
dewey-sort | 3519.7 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02972nam a2200769 cb4500</leader><controlfield tag="001">BV009598402</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180131 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940518s1994 d||| m||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792327349</subfield><subfield code="9">0-7923-2734-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29703218</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009598402</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</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</subfield><subfield code="2">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">Hertog, D. den</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Interior point approach to linear, quadratic and convex programming</subfield><subfield code="b">algorithms and complexity</subfield><subfield code="c">by D. den Hertog</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht u.a.</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 208 S.</subfield><subfield code="b">graph. Darst.</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">Mathematics and its applications</subfield><subfield code="v">277</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Delft, Univ., Diss., 1992</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematische programmering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation (mathématiques)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation linéaire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme point intérieur</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation convexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation linéaire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation quadratique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Interior-point methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</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">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">Quadratische Optimierung</subfield><subfield code="0">(DE-588)4130555-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Quadratische Optimierung</subfield><subfield code="0">(DE-588)4130555-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</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">Konvexe Optimierung</subfield><subfield code="0">(DE-588)4137027-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</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">Quadratische Optimierung</subfield><subfield code="0">(DE-588)4130555-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Mathematics and its applications</subfield><subfield code="v">277</subfield><subfield code="w">(DE-604)BV008163334</subfield><subfield code="9">277</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006343816</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 | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV009598402 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:37:44Z |
institution | BVB |
isbn | 0792327349 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006343816 |
oclc_num | 29703218 |
open_access_boolean | |
owner | DE-12 DE-739 DE-384 DE-634 DE-11 |
owner_facet | DE-12 DE-739 DE-384 DE-634 DE-11 |
physical | XI, 208 S. graph. Darst. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
publisher | Kluwer |
record_format | marc |
series | Mathematics and its applications |
series2 | Mathematics and its applications |
spelling | Hertog, D. den Verfasser aut Interior point approach to linear, quadratic and convex programming algorithms and complexity by D. den Hertog Dordrecht u.a. Kluwer 1994 XI, 208 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Mathematics and its applications 277 Zugl.: Delft, Univ., Diss., 1992 Complexité de calcul (informatique) ram Mathematische programmering gtt Programmation (mathématiques) ram Programmation linéaire ram algorithme point intérieur inriac complexité inriac programmation convexe inriac programmation linéaire inriac programmation quadratique inriac Computational complexity Interior-point methods Linear programming Optimierung (DE-588)4043664-0 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Quadratische Optimierung (DE-588)4130555-3 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Innere-Punkte-Methode (DE-588)4352322-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Quadratische Optimierung (DE-588)4130555-3 s Programmierung (DE-588)4076370-5 s DE-604 Konvexe Optimierung (DE-588)4137027-2 s Algorithmus (DE-588)4001183-5 s Innere-Punkte-Methode (DE-588)4352322-5 s 1\p DE-604 Optimierung (DE-588)4043664-0 s 2\p DE-604 Mathematics and its applications 277 (DE-604)BV008163334 277 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 | Hertog, D. den Interior point approach to linear, quadratic and convex programming algorithms and complexity Mathematics and its applications Complexité de calcul (informatique) ram Mathematische programmering gtt Programmation (mathématiques) ram Programmation linéaire ram algorithme point intérieur inriac complexité inriac programmation convexe inriac programmation linéaire inriac programmation quadratique inriac Computational complexity Interior-point methods Linear programming Optimierung (DE-588)4043664-0 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Quadratische Optimierung (DE-588)4130555-3 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd Innere-Punkte-Methode (DE-588)4352322-5 gnd |
subject_GND | (DE-588)4043664-0 (DE-588)4137027-2 (DE-588)4130555-3 (DE-588)4076370-5 (DE-588)4001183-5 (DE-588)4352322-5 (DE-588)4113937-9 |
title | Interior point approach to linear, quadratic and convex programming algorithms and complexity |
title_auth | Interior point approach to linear, quadratic and convex programming algorithms and complexity |
title_exact_search | Interior point approach to linear, quadratic and convex programming algorithms and complexity |
title_full | Interior point approach to linear, quadratic and convex programming algorithms and complexity by D. den Hertog |
title_fullStr | Interior point approach to linear, quadratic and convex programming algorithms and complexity by D. den Hertog |
title_full_unstemmed | Interior point approach to linear, quadratic and convex programming algorithms and complexity by D. den Hertog |
title_short | Interior point approach to linear, quadratic and convex programming |
title_sort | interior point approach to linear quadratic and convex programming algorithms and complexity |
title_sub | algorithms and complexity |
topic | Complexité de calcul (informatique) ram Mathematische programmering gtt Programmation (mathématiques) ram Programmation linéaire ram algorithme point intérieur inriac complexité inriac programmation convexe inriac programmation linéaire inriac programmation quadratique inriac Computational complexity Interior-point methods Linear programming Optimierung (DE-588)4043664-0 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Quadratische Optimierung (DE-588)4130555-3 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd Innere-Punkte-Methode (DE-588)4352322-5 gnd |
topic_facet | Complexité de calcul (informatique) Mathematische programmering Programmation (mathématiques) Programmation linéaire algorithme point intérieur complexité programmation convexe programmation linéaire programmation quadratique Computational complexity Interior-point methods Linear programming Optimierung Konvexe Optimierung Quadratische Optimierung Programmierung Algorithmus Innere-Punkte-Methode Hochschulschrift |
volume_link | (DE-604)BV008163334 |
work_keys_str_mv | AT hertogdden interiorpointapproachtolinearquadraticandconvexprogrammingalgorithmsandcomplexity |