1Blurb:: 2Methods are run one at a time, in sequence 3Description:: 4In the \c sequential approach, methods are run one at a time, in 5sequence. The best solutions from one method are used to initialize 6the next method. 7 8The sequence of methods (i.e. iterators) to run are specified using 9either a \c method_pointer_list or a \c method_name_list (with optional 10\c model_pointer_list). Any number of iterators may be specified. 11 12Method switching is managed through the separate convergence controls 13of each method. The number of solutions transferred between methods is 14specified by the particular method through its \ref method-final_solutions 15method control. 16 17For example, if one sets up a two-level study with a first method 18that generates multiple solutions such as a genetic algorithm, 19followed by a second method that is initialized only at a single point 20such as a gradient-based algorithm, it is possible to take the 21multiple solutions generated by the first method and create several 22instances of the second method, each one with a different initial 23starting point. 24 25The logic governing the transfer of multiple solutions between methods 26is as follows: 27\li if one solution is returned from method A, then one solution is transferred to method B. 28\li If multiple solutions are returned from method A, and method B can 29accept multiple solutions as input (for example, as a genetic 30algorithm population), then one instance of method B is initialized 31with multiple solutions. 32\li If multiple solutions are returned from method A but method B only 33can accept one initial starting point, then method B is run several 34times, each one with a separate starting point from the results of 35method A. 36 37Topics:: 38Examples:: 39Theory:: 40Faq:: 41See_Also:: 42