基于正弦型光滑打磨函数对0-1规划问题的连续化求解方法

传统的求解0-1规划问题方法大多属于直接离散的解法.现提出一个包含严格转换和近似逼近三个步骤的连续化解法:(1)借助阶跃函数把0-1离散变量转化为[0,1]区间上的连续变量;(2)对目标函数采用逼近折中阶跃函数近光滑打磨函数,约束条件采用线性打磨函数逼近折中阶跃函数,把0-1规划问题由离散问题转化为连续优化模型;(3)利用高阶光滑的解法求解优化模型.该方法打破了特定求解方法仅适用于特定类型0-1规划问题惯例,使求解0-1规划问题的方法更加一般化.在具体求解时,采用正弦型光滑打磨函数来逼近折中阶跃函数,计算效果很好.     

基于最小一乘准则的三次样条对利率期限结构的拟合

将基于最小一乘准则的三次样条函数法应用于拟合在上海证券交易所交易的国债的利率期限结构,并与传统的最小二乘法进行比较。样本外预测结果显示,稳健的最小一乘方法能有效的降低异常点的干扰,弥补最小二乘法的不足,提高预测的精度。     

自适应稀疏伪谱逼近新方法

自适应稀疏伪谱逼近法是广义混沌多项式类方法的最新进展,相对于其它方法具有计算精度高、速度快的优点.但它仍存在如下缺点：1）终止判据对逼近误差的估计精度偏低;2）只适用于单输出问题.本文提出了适用于多输出问题且具有更高逼近精度的自适应稀疏伪谱逼近新方法.本文首先提出了新型终止判据及基于此新型终止判据的自适应稀疏伪谱逼近新方法,并以命题的形式证明了新型终止判据相比于现有终止判据具有更高的估计精度,从而使基于此的逼近函数精度更接近于预期精度;进而,本文基于指标集的统一策略和新型终止判据,提出了适用于多输出问题的自适应稀疏伪谱逼近新方法,该方法因能充分利用各输出变量的抽样结果,具有比将单输出方法直接推广到多输出问题更高的计算效率.多个算例验证了本文所提出新方法的有效性和正确性.     

层次分析中对数最小一乘排序法及其性质

利用最小一乘法原理 ,在层次分析中提出了一种新的排序方法——对数最小一乘法 ,并将其转化成线性规划问题求解 ,证明了对数最小一乘法的一些性质 .     

基于门限接受算法的正交最小一乘回归新算法

正交最小一乘方法由于其稳健性而在工程中有广泛的应用,然而求解线性模型正交最小一乘参数估计算法往往过于复杂或者只对样本和变量个数较少的问题适用.把正交最小一乘参数估计问题转化为组合优化问题,再使用门限接受算法求解,通过计算机仿真说明了本文算法的正确性和有效性.     

带变系数的第二类奇异积分方程的Galerkin解法

基于对未知函数用适当的正交多项式进行逼近，本文讨论了带变系数的第二类奇异积分方程的Galerkin解法，证明了逼近解的存在唯一性，给出了逼近解在带权L^2模和一致模下的误差估计．     

Lagrange插值在—重积分Wiener空间下的同时逼近平均误差

在加权L_p范数逼近意义下,确定了基于扩充的第二类Chebyshev结点组的Lagrange插值多项式列,在一重积分Wiener空间下同时逼近平均误差的渐近阶.结果显示,在L_p范数逼近意义下,Lagrange插值多项式列逼近函数及其导数的平均误差都弱等价于相应的最佳逼近多项式列的平均误差.同时,在信息基复杂性的意义下,若可允许信息泛函为标准信息,则上述插值算子列逼近函数及其导数的平均误差均弱等价于相应的最小非自适应信息半径.     

高阶线性积分微分方程边界問題解的逼近决定中的多項式法

<正> 作者最近这几年已做出許多工作,涉及边界問題解法,即或者是对于某些类常微分积分微分方程初值問題解法或者是对于“全导数”問题解法. 最近,完全依賴C.魏尔斯特拉斯关于用多項式逼近連續函数的古典定理,作者已做出对于高阶积分微分方程的积分一种多項式法,在其中从所考虑的問題到等价的积分方程輔助系的变換起着重要作用.     

Fourier级数部分和对ω-型单调函数的逼近

引入ω－型单调函数的概念，研究了Fourier级数部分和对其的逼近问题，推广了Mazhar(1991）的结果，减弱了Salem和Zygmund(1946）的结果的条件，使Salem和Zygmund的结论适用于更大的函数类。     

基于半参数回归模型的最小一乘局部线性算法

根据最小一乘准则,推导出最小一乘局部线性估计的计算方法,并通过对模拟数据的计算和分析,对比最小一乘核算法和最小二乘局部线性算法,验证了最小一乘局部线性算法是一种有效的,稳健的估计方法,并且有降低边界效应的作用．     

The least square values and the shapley value for cooperative TU games

The main result proved in this paper is the fact that any Least Square Value is the Shapley value of a game obtained from the given game by rescaling. An Average per capita formula for Least Square Values, similar to the formula for the Shapley value (Dragan (1992)), will lead to this conclusion and allow a parallel computation for these values. The potential for the Least Square Values, a potential basis relative to Least Square Values and an approach similar to the one used for the Shapley value is allowing us to solve the Inverse problem for Least Square Values.     

Valid inequalities for concave piecewise linear regression

We consider the problem of fitting a concave piecewise linear function to multivariate data using the Least Absolute Deviation objective. We propose new valid inequalities for the problem using the properties of concave functions. Results with univariate data show that the proposed valid inequalities improve the root relaxation lower bound, permitting significant improvements in solution time.     

Weak convergence of finite element approximations of linear stochastic evolution equations with additive noise II. Fully discrete schemes

We present an abstract framework for analyzing the weak error of fully discrete approximation schemes for linear evolution equations driven by additive Gaussian noise. First, an abstract representation formula is derived for sufficiently smooth test functions. The formula is then applied to the wave equation, where the spatial approximation is done via the standard continuous finite element method and the time discretization via an I-stable rational approximation to the exponential function. It is found that the rate of weak convergence is twice that of strong convergence. Furthermore, in contrast to the parabolic case, higher order schemes in time, such as the Crank-Nicolson scheme, are worthwhile to use if the solution is not very regular. Finally we apply the theory to parabolic equations and detail a weak error estimate for the linearized Cahn-Hilliard-Cook equation as well as comment on the stochastic heat equation.     

Shape preserving approximation using least squares splines

Least squares polynomial splines are an effective tool for data fitting, but they may fail to preserve essential properties of the underlying function, such as monotonicity or convexity. The shape restrictions are translated into linear inequality conditions on spline coefficients. The basis functions are selected in such a way that these conditions take a simple form, and the problem becomes non-negative least squares problem, for which effecitive and robust methods of solution exist. Multidimensional monotone approximation is achieved by using tensor-product splines with the appropriate restrictions. Additional inter polation conditions can also be introduced. The conversion formulas to traditional B-spline representation are provided.     

Shape preserving approximation using least squares splines

Least squares polynomial splines are an effective tool for data fitting, but they may fail to preserve essential properties of the underlying function, such as monotonicity or convexity. The shape restrictions are translated into linear inequality conditions on spline coefficients. The basis functions are selected in such a way that these conditions take a simple form, and the problem becomes non-negative least squares problem, for which effecitive and robust methods of solution exist. Multidimensional monotone approximation is achieved by using tensor-product splines with the appropriate restrictions. Additional inter polation conditions can also be introduced. The conversion formulas to traditional B-spline representation are provided.     

A numerical technique for solving fractional variational problems

This paper presents an accurate numerical method for solving a class of fractional variational problems (FVPs). The fractional derivative in these problems is in the Caputo sense. The proposed method is called fractional Chebyshev finite difference method. In this technique, we approximate FVPs and end up with a finite‐dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. The fractional derivative approximation using Clenshaw and Curtis formula introduced here, along with Clenshaw and Curtis procedure for the numerical integration of a non‐singular functions and the Rayleigh–Ritz method for the constrained extremum, is considered. By this method, the given problem is reduced to the problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FVPs. Special attention is given to study the convergence analysis and evaluate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique. A comparison with another method is given. Copyright © 2012 John Wiley & Sons, Ltd.     

基于LSMC模型的煤炭资源价值定价研究

煤炭资源价值定价可以抽象为一种美式期权定价问题.最小二乘蒙特卡洛模拟(LSMC)方法是解决美式期权定价问题的一个有效途径.详尽地分析了Cortazar等人的基于资源价格、利率和便利收益随机变动的三因素定价模型,利用向量Ito定理提出了三因素模型中价格、利率和便利收益变量的递推公式.对LSMC方法原理进行了细致的阐述,总结出实现LSMC方法的完整过程,并在Matlab环境下编制了LSMC算法实现程序,进行算例计算.算例结果表明,LSMC方法用于资源定价是有效可靠的.研究为煤炭资源价值定价提供了一个完整具有可操作性的工具.     

Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints via Conditional Value at Risk and Difference of Convex Functions

Conditional Value at Risk (CVaR) has been recently used to approximate a chance constraint. In this paper, we study the convergence of stationary points, when sample average approximation (SAA) method is applied to a CVaR approximated joint chance constrained stochastic minimization problem. Specifically, we prove under some moderate conditions that optimal solutions and stationary points, obtained from solving sample average approximated problems, converge with probability one to their true counterparts. Moreover, by exploiting the recent results on large deviation of random functions and sensitivity results for generalized equations, we derive exponential rate of convergence of stationary points. The discussion is also extended to the case, when CVaR approximation is replaced by a difference of two convex functions (DC-approximation). Some preliminary numerical test results are reported.     

Numerical Evaluation of Functionals based on Variance Minimisation

Numerically evaluating the effect of a functional on a function is a very common task in scientific computing. The definite integral of a function over a domain is an example, differentiating a function in a certain point into a certain direction is another one. We developed a generic method to compute the effect of a functional using a linear approximation formula. The method is designed to generate the nodes and weights needed to approximate different functionals using a single set of tools: it regards the target function as a stochastic field and uses a user–defined covariance function for this field to minimise the error made by the approximation formula. The resulting formulas are optimal in an average case sense: all possible realisations of this stochastic field are taken into account while computing the solution. This results in nodes and weights that evaluate the target functional applied to any realisation with a minimised average error. The space of all realisations of such a stochastic field can be of infinite dimension whereas classical approaches often only consider a finite dimensional space of functions. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Numerical Method for Singularly Perturbed Third Order Ordinary Differential Equations of Convection-Diffusion Type

In this paper, we have proposed a numerical method for Singularly Perturbed Boundary Value Problems (SPBVPs) of convection-diffusion type of third order Ordinary Differential Equations (ODEs) in which the SPBVP is reduced into a weakly coupled system of two ODEs subject to suitable initial and boundary conditions. The numerical method combines boundary value technique, asymptotic expansion approximation, shooting method and finite difference scheme. In order to get a numerical solution for the derivative of the solution, the domain is divided into two regions namely inner region and outer region. The shooting method is applied to the inner region while standard finite difference scheme (FD) is applied for the outer region. Necessary error estimates are derived for the method. Computational efficiency and accuracy are verified through numerical examples. The method is easy to implement and suitable for parallel computing.