Verfügbarkeit: Interior-point polynomial algorithms in convex programming

Interior-point polynomial algorithms in convex programming:

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Nesterov, Jurij E. (VerfasserIn), Nemirovskij, Arkadij S. 1947- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Philadelphia Soc. for Industrial and Applied Mathematics 1994
Ausgabe:	2. printing
Schriftenreihe:	SIAM studies in applied mathematics 13
Schlagworte:	Polynom Konvexe Optimierung Mathematische Methode Innerer Punkt Algorithmus Polynomialzeitalgorithmus
Beschreibung:	IX, 405 S.
ISBN:	0898713196

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV013497158
003	DE-604
005	20060908
007	t
008	001215s1994 \|\|\|\| 00\|\|\| eng d
020			\|a 0898713196 \|9 0-89871-319-6
035			\|a (OCoLC)605939377
035			\|a (DE-599)BVBBV013497158
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-19 \|a DE-29T \|a DE-634 \|a DE-83
084			\|a SK 870 \|0 (DE-625)143265: \|2 rvk
084			\|a 90C25 \|2 msc
084			\|a 65K05 \|2 msc
100	1		\|a Nesterov, Jurij E. \|e Verfasser \|4 aut
245	1	0	\|a Interior-point polynomial algorithms in convex programming \|c Yurii Nestorov and Arkadii Nemirovskii
250			\|a 2. printing
264		1	\|a Philadelphia \|b Soc. for Industrial and Applied Mathematics \|c 1994
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	0	7	\|a Polynom \|0 (DE-588)4046711-9 \|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 Mathematische Methode \|0 (DE-588)4155620-3 \|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 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
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		\|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 1\p \|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 \|9 13
999			\|a oai:aleph.bib-bvb.de:BVB01-009212896
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Datensatz im Suchindex

_version_	1804128287852593152
any_adam_object
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	BV013497158
classification_rvk	SK 870
ctrlnum	(OCoLC)605939377 (DE-599)BVBBV013497158
discipline	Mathematik
edition	2. printing
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02011nam a2200517 cb4500</leader><controlfield tag="001">BV013497158</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060908 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">001215s1994 \|\|\|\| 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)605939377</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013497158</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</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="084" ind1=" " ind2=" "><subfield code="a">90C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</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 Nestorov and Arkadii Nemirovskii</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia</subfield><subfield code="b">Soc. for Industrial and Applied Mathematics</subfield><subfield code="c">1994</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="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">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">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="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">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="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="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">1\p</subfield><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">13</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009212896</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>
id	DE-604.BV013497158
illustrated	Not Illustrated
indexdate	2024-07-09T18:46:51Z
institution	BVB
isbn	0898713196
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-009212896
oclc_num	605939377
open_access_boolean
owner	DE-19 DE-BY-UBM DE-29T DE-634 DE-83
owner_facet	DE-19 DE-BY-UBM DE-29T DE-634 DE-83
physical	IX, 405 S.
publishDate	1994
publishDateSearch	1994
publishDateSort	1994
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 Nestorov and Arkadii Nemirovskii 2. printing Philadelphia Soc. for Industrial and Applied Mathematics 1994 IX, 405 S. txt rdacontent n rdamedia nc rdacarrier SIAM studies in applied mathematics 13 Polynom (DE-588)4046711-9 gnd rswk-swf Konvexe Optimierung (DE-588)4137027-2 gnd rswk-swf Mathematische Methode (DE-588)4155620-3 gnd rswk-swf Innerer Punkt (DE-588)4336760-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Innerer Punkt (DE-588)4336760-4 s Polynomialzeitalgorithmus (DE-588)4199652-5 s Konvexe Optimierung (DE-588)4137027-2 s DE-604 Algorithmus (DE-588)4001183-5 s Polynom (DE-588)4046711-9 s Mathematische Methode (DE-588)4155620-3 s 1\p DE-604 Nemirovskij, Arkadij S. 1947- Verfasser (DE-588)12209395X aut SIAM studies in applied mathematics 13 (DE-604)BV001889480 13 1\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 Polynom (DE-588)4046711-9 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Mathematische Methode (DE-588)4155620-3 gnd Innerer Punkt (DE-588)4336760-4 gnd Algorithmus (DE-588)4001183-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd
subject_GND	(DE-588)4046711-9 (DE-588)4137027-2 (DE-588)4155620-3 (DE-588)4336760-4 (DE-588)4001183-5 (DE-588)4199652-5
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_full	Interior-point polynomial algorithms in convex programming Yurii Nestorov and Arkadii Nemirovskii
title_fullStr	Interior-point polynomial algorithms in convex programming Yurii Nestorov and Arkadii Nemirovskii
title_full_unstemmed	Interior-point polynomial algorithms in convex programming Yurii Nestorov and Arkadii Nemirovskii
title_short	Interior-point polynomial algorithms in convex programming
title_sort	interior point polynomial algorithms in convex programming
topic	Polynom (DE-588)4046711-9 gnd Konvexe Optimierung (DE-588)4137027-2 gnd Mathematische Methode (DE-588)4155620-3 gnd Innerer Punkt (DE-588)4336760-4 gnd Algorithmus (DE-588)4001183-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd
topic_facet	Polynom Konvexe Optimierung Mathematische Methode Innerer Punkt Algorithmus Polynomialzeitalgorithmus
volume_link	(DE-604)BV001889480
work_keys_str_mv	AT nesterovjurije interiorpointpolynomialalgorithmsinconvexprogramming AT nemirovskijarkadijs interiorpointpolynomialalgorithmsinconvexprogramming

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge