Random Optimization

Random optimization is the name applied to a class of algorithms which can be used to solve optimization problems. Random optimization is relatively little known, but can be compared with genetic algorithms, and often random optimization outperforms other methods with significantly faster convergence. Contrast Random-restart hill climbing; genetic algorithm.

References

  • Baba, N (1989) A new approach for finding the global minimum of error functions of neural networks, Neural Networks, vol 2, pp 367-373
  • Matyas, J (1965), Random optimization, Automation and remote control, vol 26, pp 246-253
  • Solis, F.J and Wets, R.J (1981), Minimization by random search techniques, Mathematics of operations research, vol 6, no 1, pp 19-30

 

<< PreviousWord BrowserNext >>
taoiseach's residence
celia larkin
the bounty
tomas masaryk
chavo pederast
emil
the singing nun
carlos manuel rodrguez
galeazzo ciano
tridentine mass
bill stevenson
anthony martinez
application specific integrated circuit
abstract expressionism
my war
dublin castle
slip it in
ian mackaye
speed of sound
straightedge
pope benedict xv
john oswald
pope pius xi
pope pius viii
painting style
joe louis
john koza
john holland
live
george clinton (politician)
michelle yeoh
meccano
cliveden set
national party
power (sociology)
dothan
harburg
conradin
fred a. leuchter
linearity of differentiation
golden horde
calculus with polynomials
weser ems
industrial robot