This HTML5 document contains 29 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/
n5https://web.archive.org/web/20050312123844/http:/www.mat.univie.ac.at/~vpk/math/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n17https://web.archive.org/web/20050309213836/http:/www.mat.univie.ac.at/~vpk/math/
n13http://www.abo.fi/~atorn/
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:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:BRST
dbo:wikiPageWikiLink
dbr:BRST_algorithm
dbo:wikiPageDisambiguates
dbr:BRST_algorithm
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:BRST_algorithm
Subject Item
dbr:BRST_algorithm
rdf:type
dbo:Software
rdfs:label
BRST algorithm
rdfs:comment
Boender-Rinnooy-Stougie-Timmer algorithm (BRST) is an optimization algorithm suitable for finding global optimum of black box functions. In their paper Boender et al. describe their method as a stochastic method involving a combination of sampling, clustering and local search, terminating with a range of confidence intervals on the value of the global minimum. The algorithm of Boender et al. has been modified by Timmer. Timmer considered several clustering methods. Based on experiments a method named "multi level single linkage" was deemed most accurate.
dcterms:subject
dbc:Stochastic_optimization
dbo:wikiPageID
2619137
dbo:wikiPageRevisionID
980172295
dbo:wikiPageWikiLink
dbc:Stochastic_optimization dbr:Public_domain_software dbr:Global_optimum dbr:Clustering_method dbr:Black_box dbr:MCS_algorithm
dbo:wikiPageExternalLink
n5:dix_sze_eng.html n13:Globopt.html n17:gopt_eng.html
owl:sameAs
freebase:m.07s574 wikidata:Q4836450 n16:4UnXN
dbo:abstract
Boender-Rinnooy-Stougie-Timmer algorithm (BRST) is an optimization algorithm suitable for finding global optimum of black box functions. In their paper Boender et al. describe their method as a stochastic method involving a combination of sampling, clustering and local search, terminating with a range of confidence intervals on the value of the global minimum. The algorithm of Boender et al. has been modified by Timmer. Timmer considered several clustering methods. Based on experiments a method named "multi level single linkage" was deemed most accurate. Csendes' algorithms are implementations of the algorithm of [Boender et al.] and originated the public domain software product GLOBAL. The local algorithms used are a random direction, linear search algorithm also used by Törn, and a quasi—Newton algorithm not using the derivative of the function. The results show the dependence of the result on the auxiliary local algorithm used.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:BRST_algorithm?oldid=980172295&ns=0
dbo:wikiPageLength
5556
foaf:isPrimaryTopicOf
wikipedia-en:BRST_algorithm
Subject Item
dbr:BTRS
dbo:wikiPageWikiLink
dbr:BRST_algorithm
dbo:wikiPageRedirects
dbr:BRST_algorithm
Subject Item
wikipedia-en:BRST_algorithm
foaf:primaryTopic
dbr:BRST_algorithm