IMP logo
IMP Reference Guide  2.20.1
The Integrative Modeling Platform
kernel/basic_optimization.py

This illustrates a basic main loop for optimization and searching for the best scoring conformation.

1 ## \example kernel/basic_optimization.py
2 # This illustrates a basic main loop for optimization and searching for the
3 # best scoring conformation.
4 #
5 
6 from __future__ import print_function
7 import IMP.container
8 import IMP.statistics
9 import sys
10 
11 IMP.setup_from_argv(sys.argv, "Basic optimization")
12 
13 # Make 100 particles randomly distributed in a cubic box
14 m = IMP.Model()
17  IMP.algebra.Vector3D(10,10,10))
18 for i in range(100):
19  p = m.add_particle("p")
20  lsc.add(p)
23  d.set_coordinates_are_optimized(True)
24 
28 # we don't want to see lots of log messages about restraint evaluation
29 m.set_log_level(IMP.WARNING)
30 
31 # the container (lsc) stores a list of particle indices
32 pis = lsc.get_contents()
33 
35 s.set_scoring_function(sf)
36 s.set_number_of_attempts(10)
37 # but we do want something to watch
38 s.set_log_level(IMP.TERSE)
39 s.set_number_of_monte_carlo_steps(10)
40 # find some configurations which move the particles far apart
41 configs = s.create_sample()
42 for i in range(0, configs.get_number_of_configurations()):
43  configs.load_configuration(i)
44  # print out the sphere containing the point set
45  # - Why? - Why not?
47  print(sphere)
48 
49 # cluster the solutions based on their coordinates
51 
52 # of course, this doesn't return anything of interest since the points are
53 # randomly distributed, but, again, why not?
54 clustering = IMP.statistics.create_lloyds_kmeans(e, 3, 1000)
55 for i in range(0, clustering.get_number_of_clusters()):
56  # load the configuration for a central point
57  configs.load_configuration(clustering.get_cluster_representative(i))
59  print(sphere)