Joint UM-HKBU Workshop
on Mathematics and Statistics

5 December 2016 (Monday)
University of Macau

Time: 14:00-17:15
Venue: Room E11-G015, University of Macau
Guanghui Hu, University of Macau, Macau
Felix Kwok, Hong Kong Baptist University, Hong Kong
Tiejun Tong, Hong Kong Baptist University, Hong Kong
Lihu Xu, University of Macau, Macau
Xiaoming Yuan, Hong Kong Baptist University, Hong Kong
Tieyong Zeng, Hong Kong Baptist University, Hong Kong
14:00-14:30 Guanghui Hu
An Adaptive Finite Volume Framework for Steady Euler Equations

In this talk, an adaptive and high order framework of finite volume solutions for steady Euler equations will be introduced. The algorithm consists of two main parts, i.e., a Newton iteration for the linearization of the Euler equations, and a geometrical multigrid iteration for the linear solver. Several numerical issues such as solution reconstruction, curved boundary, and regularization of the system will be introduced. To improve the efficiency, h-adaptive method is studied, and several kinds of error indicators are tested. Numerical results show the effectiveness of our method successfully.

14:30-15:00 Felix Kwok
A Parareal Algorithm for Coupled Systems Arising from Optimal Control Problems

When solving optimal control problems over a long time horizon, one can introduce additional parallelism in time by subdividing the time horizon into smaller, non-overlapping time intervals and by solving these subproblems in parallel. If the intermediate state and adjoint between time intervals are known exactly, this procedure yields the exact solution. Thus, the problem reduces to solving a nonlinear system in these intermediate states, which are related via certain propagation operators. In this talk, we present a parareal approach for solving this nonlinear system: here, the global problem is approximated by a simpler one using coarse propagators, while the fine propagation is performed in parallel over different time intervals. One then iterates until the intermediate states are consistent across time intervals. Unlike parareal for initial value problems, the coarse problem still contains a forward-backward coupling, but it is much cheaper to solve than the global fine problem. We analyze the convergence of the new method for a model linear problem and illustrate its behaviour numerically for nonlinear problems in which the control enters as an additive source term. (Joint work with Martin J. Gander and Julien Salomon)

15:00-15:30 Tiejun Tong
Optimal Sequence or Ordinary Sequence? A Unified Framework for Variance Estimation in Nonparametric Regression

Difference-based methods do not require estimating the mean function in nonparametric regression and are therefore popular in practice. In this paper, we propose a unified framework for variance estimation that combines the linear regression method with the higher-order difference estimators systematically. The unified framework has greatly enriched the existing literature on variance estimation that includes most existing estimators as special cases. More importantly, the unified framework has also provided an ingenious way to solve the challenging difference sequence selection problem that remains a long-standing controversial issue in nonparametric regression for several decades. Using both theory and simulations, we recommend to use the ordinary sequence in the unified framework, no matter if the sample size is small or if the signal-to-noise ratio is large. Finally, to cater for the demands of the application, we have developed a unified R package that integrates the existing difference-based estimators and the unified estimators in nonparametric regression and will make it freely available in the R statistical program

15:30-15:45 Break
15:45-16:15 Lihu Xu
Large Deviation of Entropy Production Rate of a Stochastic Process in Magnetic Field

We shall prove that the entropy production rate of a stochastic process in magnetic field satisfies a large deviation principle and its fluctuation satisfies Cohen-Gallavotti symmetry.

16:15-16:45 Xiaoming Yuan
My Understanding of Nonlinear Programming

Nonlinear programming problems are a class of important optimization problems and there are no general/unified solvers for them. To efficiently solve a nonlinear programming problem, we generally need to consider the model meticulously in algorithmic design and analyze the theoretical issues such as the convergence carefully. I will present some of my own understandings of how to solve nonlinear programming problems, including how to understand the KKT conditions, how to understand some popular models via the variational inequality perspective, and how to develop application-tailored algorithms based on the well-known augmented Lagrangian method.

16:45-17:15 Tieyong Zeng
Image Recovery and Segmentation: Variational Approach and Sparsity

In this talk, I will briefly present the ideas of variational models for image recovery and segmentation.

Organized by:
Department of Mathematics, University of Macau
Department of Mathematics, Hong Kong Baptist University