Basic HTML version of Foils prepared 15 March 1996

Foil 7 Characteristics of Some Basic Optimization Methods

From Physical Optimization and Physical Computation CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox


1 Different methods have different trade offs
  • Robustness, accuracy, speed, suitability for parallelization,
  • problem size dependence
2 Neural networks do simple things on large data sets and parallelize easily
3 Expert systems do complex things on small data sets and parallelize with difficulty
4 Combinatorial Optimization
  • Finds exact minima in a time that is exponential in problem size. However in particular cases, e.g. TSP, very clever special techniques make this quite practical - solve exactly 104 ® 105 city problem if we can parallelize
5 Physical Optimization
  • Finds approximate minima in a time that is sometimes only linear log(linear) in system size.
  • Sometimes we only want approximate minima

in Table To:


Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998