We consider an optimal control problem described by semilinear parabolic partial differential equations, with control and state constraints. Since this problem may have no classical solutions, it is also formulated in the relaxed form. The classical control problem is then discretized by using a finite element method in space and the implicit Crank-Nicolson midpoint scheme in time, while the co...

In this paper, we describe our system used in the NEWS 2011 machine transliteration shared task. Our system consists of two main components: simple strategies for generating training examples based on character alignment, and discriminative training based on the Margin Infused Relaxed Algorithm. We submitted results for 10 language pairs on standard runs. Our system achieves the best performanc...

We consider an optimal control problem for systems governed by a highly nonlinear second order elliptic partial differential equation, with control and state constraints. The problem is formulated in the classical and in the relaxed form, and various necessary conditions for optimality are given. For the numerical solution of these problems, we propose a penalized gradient projection method gen...

We consider an optimal control problem described by a second order elliptic boundary value problem, jointly nonlinear in the state and control with high monotone nonlinearity in the state, with control and state constraints, where the state constraints and cost functional involve also the state gradient. Since no convexity assumptions are made, the problem may have no classical solutions, and s...

Relaxed technique is one of techniques for improving convergence rate of splitting iterative methods. Based on local relaxed method and system relaxed method of parallel multisplitting Frommer andMayer [A. Frommer, G. Mayer, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl. 119 (1989) 141–152], we give the global relaxed parallel multisplitting (GRPM) method by introd...

The current state-of-the-art approach in grapheme-to-phoneme (g2p) conversion is structured learning based on the Margin Infused Relaxed Algorithm (MIRA), which is an online discriminative training method for multiclass classification. However, it is known that the aggressive weight update method of MIRA is prone to overfitting, even if the current example is an outlier or noisy. Adaptive Regul...