Lagrange-type duality in DC programming

We show a Lagrange-type duality theorem for a DC programming problem, which is a generalization of previous results by J.-E. Martínez-Legaz, M. Volle [5] and Y. Fujiwara, D. Kuroiwa [1] when all constraint functions are real-valued. To the purpose, we decompose the DC programming problem into certain infinite convex programming problems.     

Lightcone dualities for hypersurfaces in the sphere

In this paper, we consider hypersurfaces in the unit lightlike sphere. The unit sphere can be canonically embedded in the lightcone and de Sitter space in Minkowski space. We investigate these hypersurfaces in the framework of the theory of Legendrian dualities between pseudo‐spheres in Minkowski space.     

STABILITY IN LAGRANGE SENSE FOR A CLASS OF STOCHASTIC STATIC NEURAL NETWORKS WITH MIXED TIME DELAYS

In this paper, the stability in Lagrange sense of a class of stochastic static neural networks with mixed time delays is studied. Based on the Lyapunov stability theory and with the help of stochastic analysis technique, the criteria for the stability in Lagrange sense of stochastic static neural networks with mixed time delays is obtained. One example is given to verify the advantage and applicability of the proposed results.     

Convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

The convergence analysis of a nonlinear Lagrange algorithm for solving nonlinear constrained optimization problems with both inequality and equality constraints is explored in detail. The estimates for the derivatives of the multiplier mapping and the solution mapping of the proposed algorithm are discussed via the technique of the singular value decomposition of matrix. Based on the estimates, the local convergence results and the rate of convergence of the algorithm are presented when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions. Furthermore, the condition number of the Hessian of the nonlinear Lagrange function with respect to the decision variables is analyzed, which is closely related to efficiency of the algorithm. Finally, the preliminary numericM results for several typical test problems are reported.     

一类行列式的插值解法

应用Lagrange插值的思想给出一类典型行列式的统一解法.     

A partially penalty immersed interface finite element method for anisotropic elliptic interface problems

In this article, we develop a partially penalty immersed interface finite element (PIFE) method for a kind of anisotropy diffusion models governed by the elliptic interface problems with discontinuous tensor‐coefficients. This method is based on linear immersed interface finite elements (IIFE) and applies the discontinuous Galerkin formulation around the interface. We add two penalty terms to the general IIFE formulation along the sides intersected with the interface. The flux jump condition is weakly enforced on the smooth interface. By proving that the piecewise linear function on an interface element is uniquely determined by its values at the three vertices under some conditions, we construct the finite element spaces. Therefore, a PIFE procedure is proposed, which is based on the symmetric, nonsymmetric or incomplete interior penalty discontinuous Galerkin formulation. Then we prove the consistency and the solvability of the procedure. Theoretical analysis and numerical experiments show that the PIFE solution possesses optimal‐order error estimates in the energy norm and norm.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1984–2028, 2014     

Arc Length Estimation and the Convergence of Polynomial Curve Interpolation

When fitting parametric polynomial curves to sequences of points or derivatives we have to choose suitable parameter values at the interpolation points. This paper investigates the effect of the parameterization on the approximation order of the interpolation. We show that chord length parameter values yield full approximation order when the polynomial degree is at most three. We obtain full approximation order for arbitrary degree by developing an algorithm which generates more and more accurate approximations to arc length: the lengths of the segments of an interpolant of one degree provide parameter intervals for interpolants of degree two higher. The algorithm can also be used to estimate the length of a curve and its arc-length derivatives. AMS subject classification (2000) 65D05, 65D10     

A new method for solving a system of generalized nonlinear variational inequalities in Banach spaces

The purpose of this paper is by using the generalized projection approach to introduce an iterative scheme for finding a solution to a system of generalized nonlinear variational inequality problem. Under suitable conditions, some existence and strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces. The results presented in the paper improve and extend some recent results.