| http://dbpedia.org/ontology/abstract
|
In evolutionary computation, Minimum Popul … In evolutionary computation, Minimum Population Search (MPS) is a computational method that optimizes a problem by iteratively trying to improve a set of candidate solutions with regard to a given measure of quality. It solves a problem by evolving a small population of candidate solutions by means of relatively simple arithmetical operations. MPS is a metaheuristic as it makes few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. For problems where finding the precise global optimum is less important than finding an acceptable local optimum in a fixed amount of time, using a metaheuristic such as MPS may be preferable to alternatives such as brute-force search or gradient descent. MPS is used for multidimensional real-valued functions but does not use the gradient of the problem being optimized, which means MPS does not require for the optimization problem to be differentiable as is required by classic optimization methods such as gradient descent and quasi-newton methods. MPS can therefore also be used on optimization problems that are not even continuous, are noisy, change over time, etc.tinuous, are noisy, change over time, etc.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://github.com/alxrcs/MPS +
|
| http://dbpedia.org/ontology/wikiPageID
|
54928163
|
| http://dbpedia.org/ontology/wikiPageLength
|
8676
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1031752343
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Particle_swarm_optimization +
, http://dbpedia.org/resource/Simulated_annealing +
, http://dbpedia.org/resource/Evolutionary_computation +
, http://dbpedia.org/resource/Estimation_of_distribution_algorithm +
, http://dbpedia.org/resource/Gradient +
, http://dbpedia.org/resource/Metaheuristic +
, http://dbpedia.org/resource/Quasi-Newton_method +
, http://dbpedia.org/resource/Category:Evolutionary_algorithms +
, http://dbpedia.org/resource/Gradient_descent +
, http://dbpedia.org/resource/Evolution_strategies +
, http://dbpedia.org/resource/Category:Metaheuristics +
, http://dbpedia.org/resource/Mathematical_optimization +
, http://dbpedia.org/resource/Differential_evolution +
, http://dbpedia.org/resource/Optimization_problem +
, http://dbpedia.org/resource/Continuous_function +
, http://dbpedia.org/resource/Brute-force_search +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:More_footnotes +
, http://dbpedia.org/resource/Template:Optimization_algorithms +
, http://dbpedia.org/resource/Template:Major_subfields_of_optimization +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Metaheuristics +
, http://dbpedia.org/resource/Category:Evolutionary_algorithms +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Minimum_Population_Search?oldid=1031752343&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Minimum_Population_Search +
|
| owl:sameAs |
http://dbpedia.org/resource/Minimum_Population_Search +
, http://www.wikidata.org/entity/Q48835601 +
, https://global.dbpedia.org/id/4X3KT +
|
| rdfs:comment |
In evolutionary computation, Minimum Popul … In evolutionary computation, Minimum Population Search (MPS) is a computational method that optimizes a problem by iteratively trying to improve a set of candidate solutions with regard to a given measure of quality. It solves a problem by evolving a small population of candidate solutions by means of relatively simple arithmetical operations.relatively simple arithmetical operations.
|
| rdfs:label |
Minimum Population Search
|
