Software for Implementing the Sequential Elimination of Level Combinations Algorithm
Genetic algorithms (GAs) are a popular technology to search for an optimum in a large search space. Using new concepts of forbidden array and weighted mutation, Mandal, Wu, and Johnson (2006) used elements of GAs to introduce a new global optimization technique called sequential elimination of level combinations (SELC), that efficiently finds optimums. A SAS macro, and MATLAB and R functions are developed to implement the SELC algorithm.
| Year of publication: |
2008-03-31
|
|---|---|
| Authors: | Johnson, Kjell ; Mandal, Abhyuday ; Ding, Tan |
| Published in: |
Journal of Statistical Software. - American Statistical Association. - Vol. 25.2008, i06
|
| Publisher: |
American Statistical Association |
Saved in:
Saved in favorites
Similar items by person
-
ada: An R Package for Stochastic Boosting
Culp, Mark, (2006)
-
Influence function analysis applied to partial least squares
Johnson, Kjell, (2007)
-
An approach for studying aliasing relations of mixed fractional factorials based on product arrays
Mandal, Abhyuday, (2005)
- More ...