Separation oracle

http://dbpedia.org/resource/Separation_oracle

A separation oracle (also called a cutting-plane oracle) is a concept in the mathematical theory of convex optimization. It is a method to describe a convex set that is given as an input to an optimization algorithm. Separation oracles are used as input to ellipsoid methods. rdf:langString

rdfs:label

rdf:langString Separation oracle

dbpedia-owl:wikiPageID

xsd:integer 57845886

dbpedia-owl:wikiPageRevisionID

xsd:integer 1072076364

dbpedia-owl:abstract

rdf:langString A separation oracle (also called a cutting-plane oracle) is a concept in the mathematical theory of convex optimization. It is a method to describe a convex set that is given as an input to an optimization algorithm. Separation oracles are used as input to ellipsoid methods.

dbpedia-owl:wikiPageLength

xsd:nonNegativeInteger 12841

dcterms:subject

<http://dbpedia.org/resource/Category:Convex_optimization>

<http://dbpedia.org/resource/Category:Mathematical_optimization>

<http://dbpedia.org/resource/Category:Computation_oracles>

dbpedia-owl:wikiPageWikiLink

<http://dbpedia.org/resource/Arborescence_(graph_theory)>

<http://dbpedia.org/resource/Independent_set_(graph_theory)>

<http://dbpedia.org/resource/Polyhedron>

<http://dbpedia.org/resource/Compact_space>

<http://dbpedia.org/resource/Convex_optimization>