How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/mp/DezaNT08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mp/DezaNT08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Antoine_Deza
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eissa_Nematollahi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tam%E2%88%9A%C2%B0s_Terlaky
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10107-006-0044-x
>
foaf:
homepage
<
https://doi.org/10.1007/s10107-006-0044-x
>
dc:
identifier
DBLP journals/mp/DezaNT08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10107-006-0044-x
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/mp
>
rdfs:
label
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Antoine_Deza
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eissa_Nematollahi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tam%E2%88%9A%C2%B0s_Terlaky
>
swrc:
number
1
(xsd:string)
swrc:
pages
1-14
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mp/DezaNT08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mp/DezaNT08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mp/mp113.html#DezaNT08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10107-006-0044-x
>
dc:
subject
Mathematics Subject Classification (2000) Primary 90C05; Secondary 90C51; Secondary 90C27; Secondary 52B12
(xsd:string)
dc:
title
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
113
(xsd:string)