共查询到20条相似文献,搜索用时 62 毫秒
1.
本文给出了求解无单调性集值变分不等式的一个新的投影算法,该算法所产生的迭代序列在Minty变分不等式解集非空且映射满足一定的连续性条件下收敛到解.对比文献[10]中的算法,本文中的算法使用了不同的线性搜索和半空间,在计算本文所引的两个数值例子时,该算法比文献[10]中的算法所需迭代步更少. 相似文献
2.
3.
4.
本文分析了求解线性方程组的一维投影算法即最小剩余法。定义了长轴陷阱及陷阱深度,用它们刻划了该算法迭代过程中锯齿现象的几何特征。本文给出了基于残差序列的避开长轴陷阱的扰动技巧,即多维投影算法。数值试验表明,投影算法要优于现在流行的主要算法。 相似文献
5.
本文在A.Blanco等人的算法的基础上,提出了max-min神经网络的一种改进了的反馈学习算法,严格证明了该算法的迭代收敛性,理论分析及实例计算结果均表明,本文算法具有算法简单,收敛速度快,输出误差小等显著特点。 相似文献
6.
7.
本文面向SIMD(SingleInstructionStream,MultipleDataStream)型机设计同步并行算法,对刚性动力学方程新算法提出了二层并行计算路径.同时,还讨论了并行计算的有关算法特性.算法分析表明,本文的算法是可行和高效的. 相似文献
8.
贺素香 《应用数学与计算数学学报》2006,20(2):64-70
本文改进了一个求解不等式约束优化问题的对偶算法,建立了一个相应的算法,进一步证明了该算法的收敛性.最后,给出数值结果以验证该算法的有效性。 相似文献
9.
非线性规划的序列仿射尺度投影内点算法 总被引:2,自引:0,他引:2
本文提出了求解非线性规划的一种序列二次规划内点算法,与其他算法的不同之处在于引进了仿射尺度变换,且避免了一维搜索,这使得该算法的计算量获得了明显的减少,本文给出了算法的详细迭代步骤并讨论了算法的收敛性。 相似文献
10.
11.
12.
13.
针对恒模算法(CMA)收敛速度较慢、收敛后均方误差较大的缺点,提出一种新的双模式盲均衡算法.在算法初期,利用能快速收敛的归一化恒模算法(NCMA)进行冷启动,在算法收敛后切换到判决引导(DD-LMS)算法,减少误码率.计算机仿真表明,提出的新算法有较快的收敛速度和较低的误码率. 相似文献
14.
We describe a fraction free version of the Matrix Berlekamp/Massey algorithm. The algorithm computes a minimal matrix generator of linearly generated square matrix sequences in an integral domain. The algorithm performs all operations in the integral domain, so all divisions performed are exact. For scalar sequences, the matrix algorithm specializes to a different algorithm than the algorithm currently in the literature. This new scalar algorithm has smaller intermediate values than the known fraction free Berlekamp/Massey algorithm. 相似文献
15.
A descent algorithm for nonsmooth convex optimization 总被引:1,自引:0,他引:1
Masao Fukushima 《Mathematical Programming》1984,30(2):163-175
This paper presents a new descent algorithm for minimizing a convex function which is not necessarily differentiable. The
algorithm can be implemented and may be considered a modification of the ε-subgradient algorithm and Lemarechal's descent
algorithm. Also our algorithm is seen to be closely related to the proximal point algorithm applied to convex minimization
problems. A convergence theorem for the algorithm is established under the assumption that the objective function is bounded
from below. Limited computational experience with the algorithm is also reported. 相似文献
16.
针对模糊C均值算法用于图像分割时对初始值敏感、容易陷入局部极值的问题,提出基于混合单纯形算法的模糊均值图像分割算法.算法利用Nelder-Mead单纯形算法计算量小、搜索速度快和粒子群算法自适应能力强、具有较好的全局搜索能力的特点,将混合单纯形算法的结果作为模糊C均值算法的输入,并将其用于图像分割.实验结果表明:基于混合单纯形算法的模糊均值图像分割算法在改善图像分割质量的同时,提高了算法的运行速度. 相似文献
17.
Yaguang Yang 《Numerical Algorithms》2017,74(4):967-996
Mehrotra’s algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra’s algorithm. This paper describes a proposal and implementation of an alternative algorithm, an arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by the arc-search infeasible interior-point algorithm and Mehrotra’s algorithm, that the proposed arc-search infeasible interior-point algorithm is a more reliable and efficient algorithm than Mehrotra’s algorithm. 相似文献
18.
提出了一种凸组合共轭梯度算法,并将其算法应用到ARIMA模型参数估计中.新算法由改进的谱共轭梯度算法与共轭梯度算法作凸组合构造而成,具有下述特性:1)具备共轭性条件;2)自动满足充分下降性.证明了在标准Wolfe线搜索下新算法具备完全收敛性,最后数值实验表明通过调节凸组合参数,新算法更加快速有效,通过具体实例证实了模型的显著拟合效果. 相似文献
19.
A rank-one algorithm is presented for unconstrained function minimization. The algorithm is a modified version of Davidon's variance algorithm and incorporates a limited line search. It is shown that the algorithm is a descent algorithm; for quadratic forms, it exhibits finite convergence, in certain cases. Numerical studies indicate that it is considerably superior to both the Davidon-Fletcher-Powell algorithm and the conjugate-gradient algorithm. 相似文献
20.
Neculai Andrei 《Numerical Functional Analysis & Optimization》2019,40(13):1467-1488
A new diagonal quasi-Newton updating algorithm for unconstrained optimization is presented. The elements of the diagonal matrix approximating the Hessian are determined as scaled forward finite differences directional derivatives of the components of the gradient. Under mild classical assumptions, the convergence of the algorithm is proved to be linear. Numerical experiments with 80 unconstrained optimization test problems, of different structures and complexities, as well as five applications from MINPACK-2 collection, prove that the suggested algorithm is more efficient and more robust than the quasi-Newton diagonal algorithm retaining only the diagonal elements of the BFGS update, than the weak quasi-Newton diagonal algorithm, than the quasi-Cauchy diagonal algorithm, than the diagonal approximation of the Hessian by the least-change secant updating strategy and minimizing the trace of the matrix, than the Cauchy with Oren and Luenberger scaling algorithm in its complementary form (i.e. the Barzilai-Borwein algorithm), than the steepest descent algorithm, and than the classical BFGS algorithm. However, our algorithm is inferior to the limited memory BFGS algorithm (L-BFGS). 相似文献