Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Global minima simulated annealing

Note The segmentation operation yields a near-optimal estimate x that may be used as initialization point for an optimization algoritlim that has to find out the global minimum of the criterion /(.). Because of its nonlinear nature, we prefer to minimize it by using a stochastic optimization algorithm (a version of the Simulated Annealing algorithm [3]). [Pg.175]

Finding the Global Energy Minimum Evolutionary Algorithms and Simulated Annealing... [Pg.495]

HyperChem has a facility for a more systematic approach to the global minimum than just choosing random starting points. This facility is associated with the idea of simulated annealing. [Pg.327]

Restrained MD (rMD) is followed by the use of MD in explicit solvent, i.e. the conformation as determined above is taken into a box containing many solvent molecules around the molecule. Subsequently, simulated annealing (SA) and energy minimizahon steps are performed to draw the molecule into the global energy minimum. An MD run (the so-called trajectory) over at least 150ps to Ins is followed and a mean structure is calculated from such a trajectory. The con-formahon must be stable under this condihon even when the experimental constraints are removed. [Pg.237]

The difficulty with this procedure is that simple refinement routines, such as simplex or least squares, lead only to the nearest minimum in the cost function which is unlikely to be the global minimum. The refinement procedure therefore has to be one that randomly samples different parts of configuration space so as to be able to reach different minima, ultimately selecting the global minimum. Two refinement methods have been proposed, simulated annealing and the genetic algorithm. [Pg.137]

Operations like pressure swing adsorption involve the condensation of the liquid in the porous medium. Several researchers developed predictive models of the configuration of liquid phase in the wet, unsaturated, porous media. The method developed by Silverstein and Fort (2000) is based on simulated annealing with random swapping of gas and liquid elements in the system to achieve a global energy minimum defined by... [Pg.163]


See other pages where Global minima simulated annealing is mentioned: [Pg.83]    [Pg.112]    [Pg.205]    [Pg.327]    [Pg.495]    [Pg.499]    [Pg.499]    [Pg.183]    [Pg.185]    [Pg.185]    [Pg.327]    [Pg.77]    [Pg.82]    [Pg.79]    [Pg.342]    [Pg.344]    [Pg.534]    [Pg.374]    [Pg.288]    [Pg.48]    [Pg.16]    [Pg.18]    [Pg.28]    [Pg.160]    [Pg.143]    [Pg.257]    [Pg.276]    [Pg.97]    [Pg.90]    [Pg.116]    [Pg.257]    [Pg.276]    [Pg.54]    [Pg.55]    [Pg.56]    [Pg.21]    [Pg.90]    [Pg.127]    [Pg.593]    [Pg.14]    [Pg.52]    [Pg.17]    [Pg.121]    [Pg.123]    [Pg.125]   
See also in sourсe #XX -- [ Pg.413 ]




SEARCH



Finding the Global Energy Minimum Evolutionary Algorithms and Simulated Annealing

Global minima

Simulated Annealing

Simulated Annealing , global

Simulating annealing

© 2024 chempedia.info