On the Local Uniqueness of Solutions of Variational Inequalities Under H-Differentiability

In this paper, we give some sufficient conditions for the local uniqueness of solutions to nonsmooth variational inequalities where the underlying functions are H-differentiable and the underlying set is a closed convex set/polyhedral set/box/polyhedral cone. We show how the solution of a linearized variational inequality is related to the solution of the variational inequality. These results extend/unify various similar results proved for C ¹ and locally Lipschitzian variational inequality problems. When specialized to the nonlinear complementarity problem, our results extend/unify those of C ² and C ¹ nonlinear complementarity problems.     

Sobolev-Hardy不等式与临界双重调和问题

该文讨论一类带有奇异系数的双重调和方程{△^2u-μu/|x|^s=f(x,u),x∈Ω,u=δu/δv=0,x∈δΩ，这里Ω包含R^N是包含0的有界光滑区域，u∈H0^2(Ω），μ∈R是参数，0≤s≤2,△^2=△△表示双重拉普拉斯算子，当f(x,u)=u^p,p=2N/N-4时，上述问题就是一个临界双重调和问题，该文运用Sobolev-Hardy不等式和变分方法，得到它的解的存在性的一些结果。     

NECESSARY CONDITIONS FOR OPTIMAL CONTROLS OF SEMILINEAR ELLIPTIC VARIATIONAL INEQUALITIES INVOLVING STATE CONSTRAINT

This paper deals with maximum principle for some optimal control problem governed by some elliptic variational inequalities. Some state constraints are discussed. The basic techniques used here are based on those in [1] and a new penalty functional defined in this paper.     

求解一类变形变分不等式的投影收缩算法及其性质

对一类变形的变分不等式：求，使得提出了一类投影收缩算法，并得到了该算法的收敛性及相关性质．     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

Parametric Quintic-Spline Approach to the Solution of a System of Fourth-Order Boundary-Value Problems

In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods.     

S3上阿诺德弦猜想中的变分方法

本文使用变分方法证明了三维标准切触球的标准勒让德扭结，至少存在一个弦连结适应于标准切触结构的任何选定切触形式，这部分证明了著名的阿诺德弦猜想。     

Variational conclusions of set-valued bifunctions on convex subsets of Banach spaces with applications

In this paper, variational conclusions of set-valued bifunctions on convex subsets of Banach spaces are investigated and several new results are obtained. The results are applied to the fixed point theory and variational inequalities. We obtain two fixed point theorems and existence theorems of solutions of variational inequalities.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?