共查询到19条相似文献,搜索用时 46 毫秒
1.
利用同伦方法求解非凸规划时,一般只能得到问题的K-K-T点.本文得到无界域上同伦方法求解非凸规划的几个收敛性定理,证明在一定条件下,通过构造合适的同伦方程,同伦算法收敛到问题的局部最优解. 相似文献
2.
In the past few years, much and much attention has been paid to the method for solving non-convex programming. Many convergence results are obtained for bounded sets. In this paper, we get global convergence results for non-convex programming in unbounded sets under suitable conditions. 相似文献
3.
4.
5.
考虑带有不等式约束的优化问题,对此问题建立组合同伦方程,给出同伦路径存在的一个条件,此条件不需要可行域满足法锥条件,获得了优化问题的K-K-T点. 相似文献
6.
提出了求解参数识别反问题的同伦正则化方法,给出了相应的收敛性定理.数值结果表明该方法是一种快速的大范围收敛方法. 相似文献
7.
ZhuDetong 《高校应用数学学报(英文版)》2000,15(2):225-238
Abstract. The secant methods discussed by Fontecilla (in 1988) are considerably revised through employing a trust region multiplier strategy and introducing a nondifferentiable merit function, In this paper the secant methods are also improved by adding a dogleg typed movement which allows to overcome a phenomena similar to the Maratos effect. Furthermore, these algorithms are analyzed and global convergence theorems as well as local superlinear conver-gence rate are proved. 相似文献
8.
9.
《数学的实践与认识》2017,(24)
给出凝聚函数的性质,利用凝聚函数构造同伦方程,证明了同伦路径的存在性,有界性和收敛性,给出非单调函数拟P_*-映射满足严格可行条件时所对应的互补问题的可解性. 相似文献
11.
12.
13.
大范围求解非线性方程组的指数同伦法 总被引:1,自引:0,他引:1
为了解决关于奇异的非线性方程组求根问题,提出了一种由同伦算法推出大范围收敛的连续型方法-指数同伦法,构造了一类指数同伦方程,克服了Jacobi矩阵的奇异,分析了指数同伦方 相似文献
15.
A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming 总被引:2,自引:0,他引:2
In this paper, on the basis of the logarithmic barrier function and KKT conditions , we propose a combined homotopy infeasible interior-point method (CHIIP) for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method. 相似文献
16.
本文研究了在非空有界闭凸集的上鞅收敛性和有界闭凸集的适应可积集值序列的收敛性.引入了反向集值mil的基础上,得到了收敛性定理及定理证明. 相似文献
17.
《Optimization》2012,61(4):585-600
In this article, a constraint shifting homotopy method (CSHM) is proposed for solving non-linear programming with both equality and inequality constraints. A new homotopy is constructed, and existence and global convergence of a homotopy path determined by it are proven. All problems that can be solved by the combined homotopy interior point method (CHIPM) can also be solved by the proposed method. In contrast to the combined homotopy infeasible interior point method (CHIIPM), it needs a weaker regularity condition. And the starting point in the proposed method is not necessarily a feasible point or an interior point, so it is more convenient to be implemented than CHIPM and CHIIPM. Numerical results show that the proposed algorithm is feasible and effective. 相似文献
18.
1 IntroductionConsider the fOllowing Logistic modelwhere A denotes the forward difference operator defined by Ax. = xu l -- x.,{r.}7=, is a sequence of nonnegative real number, {k.}7=, is a sequence ofnonnegative integers, which satisfies jt(n -- k.) = co) }it sup k. = co? andK is a positive constant. Obviously, K is the unique positive equilibrium pointof Eq.(1).FOr the special cases of Eq.(l)f re = r > 0 or k. == k 6 {0, 1, 2,' .}, therehave been many papers studying them. See, for exa… 相似文献
19.
H. P. Benson 《Journal of Optimization Theory and Applications》1982,36(1):129-134
This note presents a new convergence property for each of two branch-and-bound algorithms for nonconvex programming problems (Falk-Soland algorithms and Horst algorithms). For each algorithm, it has been shown previously that, under certain conditions, whenever the algorithm generates an infinite sequence of points, at least one accumulation point of this sequence is a global minimum. We show here that, for each algorithm, in fact, under these conditions, every accumulation point of such a sequence is a global minimum.The author would like to thank Professor R. M. Soland for his helpful comments concerning this paper. 相似文献