The topic for this year's 655-656 sequence will be Linear, Convex,  and Non-convex optimization: Deterministic algorithms in  serial and parallel computing environments.  We will focus on 

• Branch and bound algorithms.
• Decomposition of parameter sets for practical problems into convex and non-convex parameters.
• Utilization of such decompositions to solve such problems.
• Parallelization of branch and bound algorithms and algorithms based on decompositions using MPI.
• Current software and improvements to it.

The course format is subject to change. We wish to optimize the chances of producing significant advances, as evidenced in publications in recognized journals in the field.

See the course outline periodically for details.

Return to home page for the course