Efficient algorithms for a few discretized infinite-dimensional optimization problems

Events

Presentation Name：	Efficient algorithms for a few discretized infinite-dimensional optimization problems
Presenter：	文再文
Date：	2011-04-08
Location：	光华东楼1801
Abstract：	Many applied mathematical and engineering problems can be formulated as discretized infinite-dimensional optimization problems whose scale often amounts to millions of variables. We construct algorithms either from the underlying structure of the specific problems or using a family of hierarchical discretizations of the general continuous problems. Specifically, we propose an innovative fast constraint-preserving method for minimizing p-harmonic energy over spheres and the total energy function in electronic structure calculation, and a globally convergent multigrid optimization method for nonconvex problems based on a new line search procedure. Our algorithms exhibit excellent computational efficiency compared to the traditional optimization methods.
Annual Speech Directory：	No.25

220 Handan Rd., Yangpu District, Shanghai （ 200433 ）| Operator：+86 21 65642222