Parameter Estimation for the Discretely Observed Vasicek Model with Small Fractional Lévy Noise

The statistical inference of the Vasicek model driven by small Levy process has a long history.In this paper,we consider the problem of parameter estimation for Vasicek model dX_t=(μ-θX_t)dt+εdL_t^d,t∈[0,1],X_0=x_0,driven by small fractional Lévy noise with the known parameter d less than one half,based on discrete high-frequency observations at regularly spaced time points{t_i=i/n,i=1,2,...,n}.For the general case and the null recurrent case,the consistency as well as the asymptotic behavior of least squares estimation of unknown parametersμandθhave been established as small dispersion coefficientε→0 and large sample size n→∞simultaneously.     

多体系统Euler-Lagrange方程的最小二乘法与违约修正

针对受完整约束的多体系统动力学Euler-Lagrange方程,在其传统的直接增广算法和零空间方法基础上提出了当系统存在冗余约束情形下的最小二乘法.同时,对应于最小二乘法提出了改进的约束违约修正方法.本文还针对Euler-Lagrange方程的计算过程给出了相应Jacobi矩阵的QR分解和零空间连续正交基的算法.最后,以平行五连杆机构给出了数值结果并与部分现有方法进行比较.     

岭回归中确定K值方法的推广

给出了一种新的逐步改进岭参数 k的方法 .这种方法能够通过调整岭参数来进一步减少岭估计的均方误差 ,并改进了 Hoerl和 Kennard的结果 .     

求全局最优解的新算法

利用局部极大值点与动力系统的稳定奇点的对应性，计算代数方程的根、无约束极大值点、有约束极大值点、非线性规划解、及最小二乘解．我们采用了常微分方程数值解的Euler算法及网格初始点的循序迭代算法，并以具体的例子和程序说明创立的方法具有通用性，同时考虑了一些存在的问题以便在理论和算法上作进一步的改进。     

带有异方差的部分线性回归模型的B样条估计

考虑一带有异方差的固定设计部分线性回归模型yij=X'ijβ+g(tij)+εij,i=1,2…,k:j=1,2,…,ni,和sum from i=1 to kni=n,其中yij为响应变量,β=(β1,…,βp)’是未知的参数向量,g(·)是未知的函数,Xij=(Xij1,…,Xijp)’和tij∈[0,1]为已知的非随机设计点,εij为均值0,方差是σi2的随机误差,其中σi2可能不同.通过B样条级数近似非参数分量,构造了参数分量β的一个半参数广义最小二乘估计.在一些矩条件下,导出了此半参数广义最小二乘估计的渐近分布,大多数在实际中遇到的误差分布都满足这些矩条件.另外,也构造了半参数广义最小二乘估计的渐近协方差矩阵的一个相合估计,还讨论了非参数分量的B样条估计.所有这些大样本性质都是在k趋于无穷大,ni有限时导出的.这些结果能被用来做渐近有效的统计推导.     

Meshfree First-order System Least Squares

We prove convergence for a meshfree first-order system least squares （FOSLS） partition of unity finite element method （PUFEM）. Essentially, by virtue of the partition of unity, local approximation gives rise to global approximation in H（div）∩H（curl）. The FOSLS formulation yields local a posteriori error estimates to guide the judicious allotment of new degrees of freedom to enrich the initial point set in a meshfree discretization. Preliminary numerical results are provided and remaining challenges are discussed.     

An Alternating Direction Method of Multipliers for MCP-penalized Regression with High-dimensional Data

The minimax concave penalty (MCP) has been demonstrated theoretically and practically to be effective in nonconvex penalization for variable selection and parameter estimation. In this paper, we develop an efficient alternating direction method of multipliers (ADMM) with continuation algorithm for solving the MCP-penalized least squares problem in high dimensions. Under some mild conditions, we study the convergence properties and the Karush–Kuhn–Tucker (KKT) optimality conditions of the proposed method. A high-dimensional BIC is developed to select the optimal tuning parameters. Simulations and a real data example are presented to illustrate the efficiency and accuracy of the proposed method.     

The conditioning of least‐squares problems in variational data assimilation

In variational data assimilation a least‐squares objective function is minimised to obtain the most likely state of a dynamical system. This objective function combines observation and prior (or background) data weighted by their respective error statistics. In numerical weather prediction, data assimilation is used to estimate the current atmospheric state, which then serves as an initial condition for a forecast. New developments in the treatment of observation uncertainties have recently been shown to cause convergence problems for this least‐squares minimisation. This is important for operational numerical weather prediction centres due to the time constraints of producing regular forecasts. The condition number of the Hessian of the objective function can be used as a proxy to investigate the speed of convergence of the least‐squares minimisation. In this paper we develop novel theoretical bounds on the condition number of the Hessian. These new bounds depend on the minimum eigenvalue of the observation error covariance matrix and the ratio of background error variance to observation error variance. Numerical tests in a linear setting show that the location of observation measurements has an important effect on the condition number of the Hessian. We identify that the conditioning of the problem is related to the complex interactions between observation error covariance and background error covariance matrices. Increased understanding of the role of each constituent matrix in the conditioning of the Hessian will prove useful for informing the choice of correlated observation error covariance matrix and observation location, particularly for practical applications.     

Gauss–Newton methods with approximate projections for solving constrained nonlinear least squares problems

This paper is concerned with algorithms for solving constrained nonlinear least squares problems. We first propose a local Gauss–Newton method with approximate projections for solving the aforementioned problems and study, by using a general majorant condition, its convergence results, including results on its rate. By combining the latter method and a nonmonotone line search strategy, we then propose a global algorithm and analyze its convergence results. Finally, some preliminary numerical experiments are reported in order to illustrate the advantages of the new schemes.     

泛最小二乘法的改进及其容许性

考虑线性回归模型,当设计阵呈病态或秩亏时,我们用泛最小二乘法给出参数的估计,并证明其容许性;然后针对泛最小二乘估计对最小二乘估计过度压缩的缺点加以改进,使之更合理,有效.