共查询到20条相似文献,搜索用时 31 毫秒
1.
对一类特殊极大值函数非光滑方程问题的方法进行了研究, 利用极大值函数和绝对值函数的光滑函数对提出的非光滑方程问题进行转化, 提出了一种光滑保守DPRP共轭梯度法. 在一般的条件下, 给出了光滑保守DPRP共轭梯度法的全局收敛性, 最后给出相关的数值实验表明方法的有效性. 相似文献
2.
《Journal of computational and graphical statistics》2013,22(2):382-397
Computational methods are presented for spline smoothing that make it practical to compute smoothing splines of degrees other than just the standard cubic case. Specifically, an order n algorithm is developed that has conceptual and practical advantages relative to classical methods. From a conceptual standpoint, the algorithm uses only standard programming techniques that do not require specialized knowledge about spline functions, methods for solving sparse equation systems or Kalman filtering. This allows for the practical development of methods for adaptive selection of both the level of smoothing and degree of the estimator. Simulation experiments are presented that show adaptive degree selection can improve estimator efficiency over the use of cubic smoothing splines. Run-time comparisons are also conducted between the proposed algorithm and a classical, band-limited, computing method for the cubic case. 相似文献
3.
A new smoothing method of global optimization is proposed in the present paper, which prevents shifting of global minima.
In this method, smoothed functions are solutions of a heat diffusion equation with external heat source. The source helps
to control the diffusion such that a global minimum of the smoothed function is again a global minimum of the cost function.
This property, and the existence and uniqueness of the solution are proved using results in theory of viscosity solutions.
Moreover, we devise an iterative equation by which smoothed functions can be obtained analytically for a class of cost functions.
The effectiveness and potential of our method are then demonstrated with some experimental results. 相似文献
4.
本文对不等式约束优化问题给出了低阶精确罚函数的一种光滑化逼近.提出了通过搜索光滑化后的罚问题的全局解而得到原优化问题的近似全局解的算法.给出了几个数值例子以说明所提出的光滑化方法的有效性. 相似文献
5.
6.
The mixed complementarity problem can be reformulated as a nonsmooth equation by using the median operator. In this paper, we first study some useful properties of this reformulation and then derive the Chen-Harker-Kanzow-Smale smoothing function for the mixed complementarity problem. On the basis of this smoothing function, we present a smoothing Newton method for solving the mixed complementarity problem. Under suitable conditions, the method exhibits global and quadratic convergence properties. We also present a smoothing Broyden-like method based on the same smoothing function. Under appropriate conditions, the method converges globally and superlinearly. 相似文献
7.
本文探讨具有不同光滑变量的变系数模型的建模、估计和估计的渐近性.首先,从实际出发建立模型;然后,使用局部线性方法给出模型中未知函数的初始估计,再使用平均方法,给出它们的平均估计;进—步,给出这些平均估计的渐近正态性.两个模拟例子说明这一估计方法是有效的. 相似文献
8.
In this paper, the rotated cone fitting problem is considered. In case the measured data are generally accurate and it is needed to fit the surface within expected error bound, it is more appropriate to use l∞ norm than 12 norm. l∞ fitting rotated cones need to minimize, under some bound constraints, the maximum function of some nonsmooth functions involving both absolute value and square root functions. Although this is a low dimensional problem, in some practical application, it is needed to fitting large amount of cones repeatedly, moreover, when large amount of measured data are to be fitted to one rotated cone, the number of components in the maximum function is large. So it is necessary to develop efficient solution methods. To solve such optimization problems efficiently, a truncated smoothing Newton method is presented. At first, combining aggregate smoothing technique to the maximum function as well as the absolute value function and a smoothing function to the square root function, a monotonic and uniform smooth approximation to the objective function is constructed. Using the smooth approximation, a smoothing Newton method can be used to solve the problem. Then, to reduce the computation cost, a truncated aggregate smoothing technique is applied to give the truncated smoothing Newton method, such that only a small subset of component functions are aggregated in each iteration point and hence the computation cost is considerably reduced. 相似文献
9.
Smoothing Method for Minimax Problems 总被引:7,自引:0,他引:7
Song Xu 《Computational Optimization and Applications》2001,20(3):267-279
In this paper, we propose a smoothing method for minimax problem. The method is based on the exponential penalty function of Kort and Bertsekas for constrained optimization. Under suitable condition, the method is globally convergent. Preliminary numerical experiments indicate the promising of the algorithm. 相似文献
10.
圆锥规划是一类重要的非对称锥优化问题.基于一个光滑函数,将圆锥规划的最优性条件转化成一个非线性方程组,然后给出求解圆锥规划的光滑牛顿法.该算法只需求解一个线性方程组和进行一次线搜索.运用欧几里得约当代数理论,证明该算法具有全局和局部二阶收敛性.最后数值结果表明算法的有效性. 相似文献
11.
In this paper we present an extension of Reusken's Lemma about the smoothing property of a multigrid method for solving non-symmetric linear systems of equations. One of the consequences of this extended lemma is the verification of the smoothing property for all damping factors oϵ(0, 1). Additionally, a semi-iterative smoother is constructed which gives, in some sense, optimal smoothing rate estimates. 相似文献
12.
This paper concerns smoothing by infimal convolution for two large classes of functions: convex, proper and lower semicontinous as well as for (the nonconvex class of) convex-composite functions. The smooth approximations are constructed so that they epi-converge (to the underlying nonsmooth function) and fulfill a desirable property with respect to graph convergence of the gradient mappings to the subdifferential of the original function under reasonable assumptions. The close connection between epi-convergence of the smoothing functions and coercivity properties of the smoothing kernel is established. 相似文献
13.
14.
对于不可微的"极大值"形式的函数,可以利用凝聚函数对其进行光滑逼近.借助这个技术,给出了求解线性互补问题的光滑方程组算法.首先是将互补问题转化为等价的非光滑方程组,再利用凝聚函数进行光滑逼近,从而转化为光滑方程组的求解问题.通过一些考题对这个算法进行了数值试验,结果显示了该算法的有效性和稳定性. 相似文献
15.
通过对磨光法及马尔可夫过程的研究,马氏过程作为区间预测的一种方法,在很大程度上约束了它预测的科学性,另外,磨光法本身也是一种迭代的方法,对于拟合的精度还是难于控制,通过拟马尔可夫矩阵与磨光法相结合及优化工具,得到拟马尔可夫过程的磨光优化算法,实例表明:拟马尔可夫过程的磨光优化算法使修正磨光后的值逼近原数据值的程度较其它算法更好,而且,拟马尔可夫矩阵反应了从一种状态到另一种状态的转移程度,并且这种算法具有更好的推广和应用。 相似文献
16.
本文提出了数据挖掘中求解聚类中心问题的一种新方法.这类问题属于非凸非光滑全局最优化问题.我们首先利用光滑化方法将非光滑聚类函数用光滑函数逼近,然后对光滑化问题利用填充函数搜索其全局最优点.对不同数据库的数值试验表明,本文提出的算法是可行和有效的. 相似文献
17.
研究一类无限维非线性互补问题的光滑化牛顿法.借助于非线性互补函数,将无限维非线性互补问题转化为一个非光滑算子方程.构造光滑算子逼近非光滑算子,在光滑逼近算子满足方向可微相容性的条件下,证明了光滑化牛顿法具有超线性收敛性. 相似文献
18.
《Journal of computational and graphical statistics》2013,22(2):354-381
This article presents a method for estimating functions on topologically and/or geometrically complex surfaces from possibly noisy observations. Our approach is an extension of spline smoothing, using a finite element method. The article has a substantial tutorial component: we start by reviewing smoothness measures for functions defined on surfaces, simplicial surfaces and differentiable structures on such surfaces, subdivison functions, and subdivision surfaces. After describing our method, we show results of an experiment comparing finite element approximations to exact smoothing splines on the sphere, and we give examples suggesting that generalized cross-validation is an effective way of determining the optimal degree of smoothing for function estimation on surfaces. 相似文献
19.
为了拟合纵向数据和其他相关数据,本文提出了变系数混合效应模型(VCMM).该模型运用变系数线性部分来表示协变量对响应变量的影响,而用随机效应来描述纵向数据组内的相关性, 因此,该模型允许协变量和响应变量之间存在十分灵活的泛函关系.文中运用光滑样条来估计均值部分的系数函数,而用限制最大似然的方法同时估计出光滑参数和方差成分,我们还得到了所提估计的计算方法.大量的模拟研究表明对于具有各种协方差结构的变系数混合效应模型,运用本文所提出的方法都能够十分有效地估计出模型中的系数函数和方差成分. 相似文献
20.
The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions. 相似文献