Past

/notices/events/abstracts/stochastic-analysis/mt06/o

\\common\dfs\htdocs\www\maintainers\reception\enb\abstracts\string-theory\mt06\minasian.shtml

http://www.maths.ox.ac.uk/arg

Many large-scale optimization problems arise in the context of the discretization of infinite dimensional applications. In such cases, the description of the finite-dimensional problem is not unique, but depends on the discretization used, resulting in a natural multi-level description. How can such a problem structure be exploited, in discretized problems or more generally? The talk will focus on discussing this issue in the context of unconstrained optimization and in relation with the classical multigrid approach to elliptic systems of partial differential equations. Both theoretical convergence properties of special purpose algorithms and their numerical performances will be discussed. Perspectives will also be given.

Collaboration with S. Gratton, A. Sartenaer and M. Weber.