This HTML5 document contains 30 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n13https://www2.isye.gatech.edu/~nemirovs/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Oracle_complexity_(optimization)
rdfs:label
Oracle complexity (optimization)
rdfs:comment
In mathematical optimization, oracle complexity is a standard theoretical framework to study the computational requirements for solving classes of optimization problems. It is suitable for analyzing iterative algorithms which proceed by computing local information about the objective function at various points (such as the function's value, gradient, Hessian etc.). The framework has been used to provide tight worst-case guarantees on the number of required iterations, for several important classes of optimization problems.
dcterms:subject
dbc:Mathematical_optimization
dbo:wikiPageID
64271048
dbo:wikiPageRevisionID
1060914898
dbo:wikiPageWikiLink
dbr:Stationary_point dbr:Proximal_operator dbr:Hessian_matrix dbr:Euclidean_space dbr:Computational_complexity dbr:Mathematical_optimization dbr:Gradient dbc:Mathematical_optimization dbr:Gradient_descent dbr:Convex_function dbr:Stochastic_optimization dbr:Iterative_method
dbo:wikiPageExternalLink
n13:LecEMCO.pdf
owl:sameAs
n8:BwqzQ wikidata:Q96397629
dbp:wikiPageUsesTemplate
dbt:Orphan dbt:Cite_web dbt:Cite_journal dbt:Cite_book dbt:Reflist
dbo:abstract
In mathematical optimization, oracle complexity is a standard theoretical framework to study the computational requirements for solving classes of optimization problems. It is suitable for analyzing iterative algorithms which proceed by computing local information about the objective function at various points (such as the function's value, gradient, Hessian etc.). The framework has been used to provide tight worst-case guarantees on the number of required iterations, for several important classes of optimization problems.
prov:wasDerivedFrom
wikipedia-en:Oracle_complexity_(optimization)?oldid=1060914898&ns=0
dbo:wikiPageLength
9105
foaf:isPrimaryTopicOf
wikipedia-en:Oracle_complexity_(optimization)
Subject Item
wikipedia-en:Oracle_complexity_(optimization)
foaf:primaryTopic
dbr:Oracle_complexity_(optimization)