A new parallel algorithm for global optimization with application to the molecular cluster problem
Cornell Theory Center, Cornell University, 1994 - Computers - 22 pages
1 page matching constrained problem in this book
Results 1-1 of 1
What people are saying - Write a review
We haven't found any reviews in the usual places.
20 atoms absorbing neighborhood absorbing set Advanced Computing Research Aiping Liao algorithm for global algorithms for solving average elapsed average-efficiency average-speedup better point choose Chunguang Sun Cluster Problem Aiping Coleman Computing Research Institute constrained problem continuous function Cornell Theory Center current iterate denote deterministic algorithm expected number fe(x finding a global FORTRAN full-range algorithm function h global minimizer xopt global optimization global solution initial point Lennard-Jones potential function LOCMIN LOCMIN(x memory BFGS method minimization procedure Molecular Cluster Problem nat0m natom atoms Newton's method nproc number of iterations Numerical results nv processors objective function optimal trajectory output parallel algorithm parallel implementations parallel performance partially separable structure Pi(A problem with 20 problem with natom processor p(0 proposed algorithm Proposition 2.1 Protein Folding randomly a search search direction search region simple algorithm simulated annealing single-range algorithm SP1 parallel computer subproblems technique trajectory for function uniform distribution variants yen3