A Strongly Semismooth Integral Function and Its Application

As shown by an example, the integral function f : ⁿ , defined by f(x) = _a ^b[B(x, t)]₊ g(t) dt, may not be a strongly semismooth function, even if g(t) 1 and B is a quadratic polynomial with respect to t and infinitely many times smooth with respect to x. We show that f is a strongly semismooth function if g is continuous and B is affine with respect to t and strongly semismooth with respect to x, i.e., B(x, t) = u(x)t + v(x), where u and v are two strongly semismooth functions in ⁿ . We also show that f is not a piecewise smooth function if u and v are two linearly independent linear functions, g is continuous and g 0 in [a, b], and n 2. We apply the first result to the edge convex minimum norm network interpolation problem, which is a two-dimensional interpolation problem.     

非光滑方程组牛顿法的全局收敛性分析

通过定义一种新的*-微分,本文给出了局部Lipschitz非光滑方程组的牛顿法,并对其全局收敛性进行了研究.该牛顿法结合了非光滑方程组的局部收敛性和全局收敛性.最后,我们把这种牛顿法应用到非光滑函数的光滑复合方程组问题上,得到了较好的收敛性.     

A nonsmooth version of Newton's method

Newton's method for solving a nonlinear equation of several variables is extended to a nonsmooth case by using the generalized Jacobian instead of the derivative. This extension includes the B-derivative version of Newton's method as a special case. Convergence theorems are proved under the condition of semismoothness. It is shown that the gradient function of the augmented Lagrangian forC ²-nonlinear programming is semismooth. Thus, the extended Newton's method can be used in the augmented Lagrangian method for solving nonlinear programs.This author's work is supported in part by the Australian Research Council.This author's work is supported in part by the National Science Foundation under grant DDM-8721709.     

A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems

In this paper we introduce a general line search scheme which easily allows us to define and analyze known and new semismooth algorithms for the solution of nonlinear complementarity problems. We enucleate the basic assumptions that a search direction to be used in the general scheme has to enjoy in order to guarantee global convergence, local superlinear/quadratic convergence or finite convergence. We examine in detail several different semismooth algorithms and compare their theoretical features and their practical behavior on a set of large-scale problems.     

P0-函数箱约束变分不等式的正则半光滑牛顿法

1引言设X C R~n,F：R~n→R~n,变分不等式Ⅵ(X,F)是指：求x∈X,使F(x)~T(y-x)≥0,(?)_y∈X．(1)记i∈N={1,2,…,n},当X=[a,b]：={x∈(?)~n|a_i≤x_i≤b_i,i∈N}时,称Ⅵ(X,F)为箱约束变分不等式(也有些文献称为混合互补问题),记为Ⅵ(a,b,F)．若a_i=0,b_i= ∞,i∈N,即X=(?)_ ~n：={x∈(?)~n|x≥0}时,Ⅵ(a,b,F)化为非线性互补问题NCP(F)：求x∈(?)_ ~n,使x≥0,F(x)≥0,x~TF(x)=0．(2)     

Banach空间中半光滑算子方程的不精确牛顿法(英文)

本文主要解决Banach空间中抽象的半光滑算子方程的解法.提出了两种不精确牛顿法,它们的收敛性同时得到了证明.这两种方法可以看作是有限维空间中已存在的解半光滑算子方程的方法的延伸.     

A Newton method for a class of quasi-variational inequalities

A variant of the Newton method for nonsmooth equations is applied to solve numerically quasivariational inequalities with monotone operators. For this purpose, we investigate the semismoothness of a certain locally Lipschitz operator coming from the quasi-variational inequality, and analyse the generalized Jacobian of this operator to ensure local convergence of the method. A simplified variant of this approach, applicable to implicit complementarity problems, is also studied. Small test examples have been computed.This work has been supported in parts by a grant from the German Scientific Foundation and by a grant from the Czech Academy of Sciences.