Module I, Advanced Algorithms: Optimization and Search Methods
You should understand the slides, work with the material to be read,
and do the homework:
You should use the NEOS-server suite to find the minimum of our simple
function for significant sets of fixed parameters (a,b,c,d,e,f,g,...).
You should form a group with at most one other student,
select in accordance with Prof. Arno Formella one
optimization algorithm
and elaborate a not too short and not too long article
(6 to 10 pages) about the algorithm, including at least the aspects:
description of the algorithm,
main field of application,
advantages and disadvantages compared to other algorithms,
available software/implementations,
critical discussion of their APIs,
and references on the algorithm and its applications.
slides (containing the introductional material)
|
