MCS algorithm
For mathematical optimization, Multilevel Coordinate Search (MCS) is an efficient algorithm for bound constrained global optimization using function values only. To do so, the n-dimensional search space is represented by a set of non-intersecting hypercubes (boxes). The boxes are then iteratively split along an axis plane according to the value of the function at a representative point of the box (and its neighbours) and the box's size. These two splitting criteria combine to form a global search by splitting large boxes and a local search by splitting areas for which the function value is good.
- Comment
- enFor mathematical optimization, Multilevel Coordinate Search (MCS) is an efficient algorithm for bound constrained global optimization using function values only. To do so, the n-dimensional search space is represented by a set of non-intersecting hypercubes (boxes). The boxes are then iteratively split along an axis plane according to the value of the function at a representative point of the box (and its neighbours) and the box's size. These two splitting criteria combine to form a global search by splitting large boxes and a local search by splitting areas for which the function value is good.
- Depiction
- Has abstract
- enFor mathematical optimization, Multilevel Coordinate Search (MCS) is an efficient algorithm for bound constrained global optimization using function values only. To do so, the n-dimensional search space is represented by a set of non-intersecting hypercubes (boxes). The boxes are then iteratively split along an axis plane according to the value of the function at a representative point of the box (and its neighbours) and the box's size. These two splitting criteria combine to form a global search by splitting large boxes and a local search by splitting areas for which the function value is good. Additionally, a local search combining a (multi-dimensional) quadratic interpolant of the function and line searches can be used to augment performance of the algorithm (MCS with local search); in this case the plain MCS is used to provide the starting (initial) points. The information provided by local searches (local minima of the objective function) is then fed back to the optimizer and affects the splitting criteria, resulting in reduced sample clustering around local minima, faster convergence and higher precision.
- Hypernym
- Algorithm
- Is primary topic of
- MCS algorithm
- Label
- enMCS algorithm
- Link from a Wikipage to an external page
- www.mat.univie.ac.at/~neum/glopt/janka/dix_sze_eng.html
- www.mat.univie.ac.at/~neum/software/mcs/
- Link from a Wikipage to another Wikipage
- Algorithm
- Candidate solution
- Category:Optimization algorithms and methods
- Derivative-free optimization
- File:MCS algorithm.gif
- File:MCS-himmelblau-new.gif
- Function (mathematics)
- Global optimization
- Line search
- Mathematical optimization
- Recursion (computer science)
- Tree (data structure)
- SameAs
- 4r1kT
- m.07s4y3
- MCS algorithm
- MCS algorithm
- Q6714997
- Subject
- Category:Optimization algorithms and methods
- Thumbnail
- WasDerivedFrom
- MCS algorithm?oldid=1078871932&ns=0
- WikiPageLength
- 5713
- Wikipage page ID
- 2618980
- Wikipage revision ID
- 1078871932
- WikiPageUsesTemplate
- Template:Reflist
