Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

The smoothing Newton method for solving a system of nonsmooth equations , which may arise from the nonlinear complementarity problem, the variational inequality problem or other problems, can be regarded as a variant of the smoothing method. At the th step, the nonsmooth function is approximated by a smooth function , and the derivative of at is used as the Newton iterative matrix. The merits of smoothing methods and smoothing Newton methods are global convergence and convenience in handling. In this paper, we show that the smoothing Newton method is also superlinearly convergent if is semismooth at the solution and satisfies a Jacobian consistency property. We show that most common smooth functions, such as the Gabriel-Moré function, have this property. As an application, we show that for box constrained variational inequalities if the involved function is -uniform, the iteration sequence generated by the smoothing Newton method will converge to the unique solution of the problem globally and superlinearly (quadratically).

     

A Hybrid Smoothing Method for Mixed Nonlinear Complementarity Problems

In this paper, we describe a new, integral-based smoothing method for solving the mixed nonlinear complementarity problem (MNCP). This approach is based on recasting MNCP as finding the zero of a nonsmooth system and then generating iterates via two types of smooth approximations to this system. Under weak regularity conditions, we establish that the sequence of iterates converges to a solution if the limit point of this sequence is regular. In addition, we show that the rate is Q-linear, Q-superlinear, or Q-quadratic depending on the level of inexactness in the subproblem calculations and we make use of the inexact Newton theory of Dembo, Eisenstat, and Steihaug. Lastly, we demonstrate the viability of the proposed method by presenting the results of numerical tests on a variety of complementarity problems.     

LOWLAD: a locally weightedL 1 smoothing spline algorithm with cross validated choice of smoothing parameters

The computation ofL ₁ smoothing splines on large data sets is often desirable, but computationally infeasible. A locally weighted, LAD smoothing spline based smoother is suggested, and preliminary results will be discussed. Specifically, one can seek smoothing splines in the spacesW _m (D), with [0, 1] ⁿ D. We assume data of the formy _i =f(t _i )+ _i ,i=1,..., N with {t _i } _i=1 ^N D, the _i are errors withE( _i )=0, andf is assumed to be inW _m . An LAD smoothing spline is the solution,s , of the following optimization problem

二维振荡叶栅非定常粘性流动数值模拟

采用显式四步Runge-Kutta格式，结合Baldwon-Lomax紊流模型求解Navier-Stokes方程，借助运动网格技术，完成了对二维振荡叶栅非定常粘性流动的数值模拟。为了加速求解过程，引入了变系数隐式残差光顺方法，取得了较好效果。数值结果与已公布的数据有很好的一致性。     

灰度图像复原的一种空间适应性向前向后扩散模型

该文考虑退化灰度图像复原问题. 首先, 作者利用时滞正则化方法定义退化图像去噪过程和去模糊过程之间的权重函数, 将激波过滤器边缘增强模型与水平集运动去噪模型相结合, 建立一种新的图像磨光增强偏微分方程. 然后, 证明该偏微分方程初值问题黏性弱解的存在唯一性. 最后, 给出该模型的部分数值算例.     

变系数混合模型的光滑样条推断

为了拟合纵向数据和其他相关数据,本文提出了变系数混合效应模型(VCMM).该模型运用变系数线性部分来表示协变量对响应变量的影响,而用随机效应来描述纵向数据组内的相关性, 因此,该模型允许协变量和响应变量之间存在十分灵活的泛函关系.文中运用光滑样条来估计均值部分的系数函数,而用限制最大似然的方法同时估计出光滑参数和方差成分,我们还得到了所提估计的计算方法.大量的模拟研究表明对于具有各种协方差结构的变系数混合效应模型,运用本文所提出的方法都能够十分有效地估计出模型中的系数函数和方差成分.     

Estimating and Visualizing Conditional Densities

Abstract

We consider the kernel estimator of conditional density and derive its asymptotic bias, variance, and mean-square error. Optimal bandwidths (with respect to integrated mean-square error) are found and it is shown that the convergence rate of the density estimator is order n ^–2/3. We also note that the conditional mean function obtained from the estimator is equivalent to a kernel smoother. Given the undesirable bias properties of kernel smoothers, we seek a modified conditional density estimator that has mean equivalent to some other nonparametric regression smoother with better bias properties. It is also shown that our modified estimator has smaller mean square error than the standard estimator in some commonly occurring situations. Finally, three graphical methods for visualizing conditional density estimators are discussed and applied to a data set consisting of maximum daily temperatures in Melbourne, Australia.     

Nearest-neighbour modelling of reciprocal chains

This paper focuses on the class of finite-state, discrete-index, reciprocal processes (reciprocal chains). Such a class of processes seems to be a suitable setup in many applications and, in particular, it appears well-suited for image-processing. While addressing this issue, the aim is 2-fold: theoretic and practical. As to the theoretic purpose, some new results are provided: first, a general stochastic realization result is provided for reciprocal chains endowed with a known, arbitrary, distribution. Such a model has the form of a fixed-degree, nearest-neighbour polynomial model. Next, the polynomial model is shown to be exactly linearizable, which means it is equivalent to a nearest-neighbour linear model in a different set of variables. The latter model turns out to be formally identical to the Levi–Frezza–Krener linear model of a Gaussian reciprocal process, although actually non-linear with respect to the chain's values. As far as the practical purpose is concerned, in order to yield an example of application an estimation issue is addressed: a suboptimal (polynomial-optimal) solution is derived for the smoothing problem of a reciprocal chain partially observed under non-Gaussian noise. To this purpose, two kinds of boundary conditions (Dirichlet and Cyclic), specifying the reciprocal chain on a finite interval, are considered, and in both cases the model is shown to be well-posed, in a ‘wide-sense’. Under this view, some well-known representation results about Gaussian reciprocal processes extend, in a sense, to a ‘non-Gaussian’ case.     

用半光滑牛顿法求解一般的凸光顺问题

本文讨论一般的凸光顺问题minF（y）：=∫a^b（｜D^k y｜）^2dt＋∑（i=1）^N ωi｜y（ti）-zi｜^2．其中,忌芝3而且可在闭凸集凡K（∪→）L2^k[a,b]．我们把该问题转化为半光滑方程组并给出一个求解该方程组的半光滑牛顿算法．最后证明算法的超线性收敛性并给出数值算例．     

Predictor-Corrector Smoothing Methods for Monotone LCP

In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1],the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1‘ is obtained under the assumption of nonsingularity of generalized Jacobian of Φ(x,y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The efficiency of the two methods is tested by numerical experiments.