| http://dbpedia.org/ontology/abstract
|
A separation oracle (also called a cutting … 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.es are used as input to ellipsoid methods.
|
| http://dbpedia.org/ontology/wikiPageID
|
57845886
|
| http://dbpedia.org/ontology/wikiPageLength
|
12841
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1072076364
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Knapsack_problem +
, http://dbpedia.org/resource/Black_box +
, http://dbpedia.org/resource/Convex_optimization +
, http://dbpedia.org/resource/Subgradient +
, http://dbpedia.org/resource/Configuration_linear_program +
, http://dbpedia.org/resource/Arborescence_%28graph_theory%29 +
, http://dbpedia.org/resource/Polytope +
, http://dbpedia.org/resource/Independent_set_%28graph_theory%29 +
, http://dbpedia.org/resource/Polyhedron +
, http://dbpedia.org/resource/Category:Computation_oracles +
, http://dbpedia.org/resource/Ellipsoid_method +
, http://dbpedia.org/resource/Convex_function +
, http://dbpedia.org/resource/Linear_program +
, http://dbpedia.org/resource/Karmarkar-Karp_bin_packing_algorithms +
, http://dbpedia.org/resource/Diophantine_approximation +
, http://dbpedia.org/resource/Bin_packing_problem +
, http://dbpedia.org/resource/Convex_set +
, http://dbpedia.org/resource/Minimum_cut +
, http://dbpedia.org/resource/Compact_space +
, http://dbpedia.org/resource/Category:Convex_optimization +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Rp +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Convex_optimization +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/Category:Computation_oracles +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Separation_oracle?oldid=1072076364&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Separation_oracle +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q109381637 +
, http://dbpedia.org/resource/Separation_oracle +
, https://global.dbpedia.org/id/G68b2 +
|
| rdfs:comment |
A separation oracle (also called a cutting … 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.es are used as input to ellipsoid methods.
|
| rdfs:label |
Separation oracle
|
