In this paper, we develop and analyze the Runge-Kutta discontinuous Galerkin (RKDG) method to solve weakly coupled hyperbolic multi-domain problems. Such problems involve transfer type boundary conditions with discontinuous fluxes between different domains, calling for special techniques to prove stability of the RKDG methods. We prove both stability and error estimates for our RKDG methods on simple models, and then apply them to a biological cell proliferation model \cite{EMSC}. Numerical results are provided to illustrate the good behavior of our RKDG methods.

By the integral method, we prove that any space-like entire graphic self-shrinking solution to Lagrangian mean curvature flow in $\mathbb{R}^{2n}_{n}$ with the indefinite metric $\sum_i dx_idy_i$ is flat. This result improves the previous ones in [9] and [1] by removing the additional assumption in their results. In a similar manner, we reprove its Euclidean counterpart which is established in [1].

This paper is devoted to the study of the proximal point algorithm for solving monotone second-order cone complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point algorithm is verified to have global and superlinear convergence properties. For the purpose of solving the subproblems efficiently, we introduce a generalized Newton method and show that only one Newton step is eventually needed to obtain a desired approximate solution that approximately satisfies the appropriate criterion under mild conditions. Numerical comparisons are also made with the derivative-free descent method used by Pan and Chen (Optimization 59:11731197, 2010), which confirm the theoretical results

In this paper, we formulate a problem of simultaneous redundant via insertion and line end extension for via yield optimization. Our problem is more general than previous works in the sense that more than one type of line end extension is considered and the objective function to be optimized directly accounts for via yield. We present a zero-one integer linear program based approach, that is equipped with two speedup techniques, to solve the addressed problem optimally. In addition, we describe how to modify our approach to exactly solve a previous work. Extensive experimental results are shown to demonstrate the effectiveness and efficiency of our approaches.

Let  $\sum$ be a complete minimal Lagrangian submanifold of $\mathbb{C}^n$. We identify regions in the Grassmannian of Lagrangian subspaces so that whenever the image of the Gauss map of $\sum$ lies in one of these regions, then  $\sum$ is an affine space.