共查询到20条相似文献,搜索用时 296 毫秒
1.
基于非线性规划和割平面方法,给出了凸半无限规划问题的一个分析中央割平面算法(ACCPM).该算法不需要在每一次迭代时计算所有的约束数值,而只需要求解一个中央割平面,从而使得问题的求解规模变小,这种算法对于求解可行域结构比较复杂的半无限规划非常有效,最后给出算法的收敛性证明. 相似文献
2.
3.
本文研究了求解半无限规划的两个算法框架.利用离散化方法和局部约化方法,提出了两个求解半无限规划的算法框架.在温和的条件下,证明了基于离散化方法的算法框架具有弱全局收敛性.数值试验表明所提出的算法框架是有效的. 相似文献
4.
5.
6.
本文在广义半无限规划问题的最优解集X处满足某些条件的前提下将广义半无限规划问题转化成KKT系统,通过扰动的FB函数,将KKT系统转化为一组光滑函数方程,设计了一个光滑牛顿算法,证明了算法的全局收敛性,并且在光滑函数解集处满足局部误差界条件下证明了算法具有超线性收敛速率. 相似文献
7.
本文利用一个精确增广Lagrange函数研究了一类广义半无限极小极大规划问题。在一定的条件下将其转化为标准的半无限极小极大规划问题。研究了这两类问题的最优解和最优值之间的关系,利用这种关系和标准半无限极小极大规划问题的一阶最优性条件给出了这类广义半无限极小极大规划问题的一个新的一阶最优性条件。 相似文献
8.
9.
10.
11.
基于信息再利用的灰色系统GM(1.1)模型建模方法及应用 总被引:1,自引:0,他引:1
张世强 《数学的实践与认识》2009,39(13)
目的:寻找新的灰色系统GM(1.1)模型建模方法,建立拟合精度与预测精度较高的GM(1.1)模型.方法:在邓聚龙教授建模方法的基础上,用基于信息再利用的方法,建立新的灰色系统GM(1.1)模型.结果:用基于信息再利用的灰色系统GM(1.1)模型建模方法建立的GM(1.1)模型,其拟合精度与预测精度不但优于传统方法建立的GM(1.1)模型,而且优于其他改进方法建立的GM(1.1)模型.结论:基于信息再利用的灰色系统GM(1.1)模型建模方法不但建模过程简单适用,而且其建立的GM(1.1)模型拟合精度与预测精度优于其他改进方法建立的GM(1.1)模型,因而具有广泛的应用价值. 相似文献
12.
Víctor Parada Lorena Pradenas Muricio Solar Rodrigo Palma 《Annals of Operations Research》2002,117(1-4):151-163
In this article, a meta-heuristic method to solve the non-guillotine cutting stock problem is proposed. The method is based on a combination between the basic principles of the constructive and evolutive methods. With an adequate management of the parameters involved, the method allows regulation of the solution quality to computational effort relationship. This method is applied to a particular case of cutting problems, with which the computational behaviors is evaluated. In fact, 1000 instances of the problem have been classified according to their combinatorial degree and then the efficiency and robustness of the method have been tested. The final results conclude that the proposed method generates an average error close to 2.18% with respect to optimal solutions. It has also been verified that the method yields solutions for all of the instances examined; something that has not been achieved with an exact constructive method, which was also implemented. Comparison of the running times demonstrates the superiority of the proposed method as compared with the exact method. 相似文献
13.
赵天宇 《应用数学与计算数学学报》2002,16(1):29-34
本文给出了求解一类约束优化问题的一个Newton分裂算法,并证明了算法的局部平方收敛性,该算法与已有算法相比,具有计算量小的特点,因而特别适合于求解大规模问题,为进一步降低算法的计算复杂性,我们结合Broyden算法,给出了两类Broyden类分裂算法。 相似文献
14.
Bilel Kchouk Jean-Pierre Dussault 《Journal of Optimization Theory and Applications》2013,157(1):148-167
We present a method, based on the Chebyshev third-order algorithm and accelerated by a Shamanskii-like process, for solving nonlinear systems of equations. We show that this new method has a quintic convergence order. We will also focus on efficiency of high-order methods and more precisely on our new Chebyshev–Shamanskii method. We also identify the optimal use of the same Jacobian in the Shamanskii process applied to the Chebyshev method. Some numerical illustrations will confirm our theoretical analysis. 相似文献
15.
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities 总被引:4,自引:0,他引:4
The D-gap function has been useful in developing unconstrained descent methods for solving strongly monotone variational inequality problems. We show that the D-gap function has certain properties that are useful also for monotone variational inequality problems with bounded feasible set. Accordingly, we develop two unconstrained methods based on them that are similar in spirit to a feasible method of Zhu and Marcotte based on the regularized-gap function. We further discuss a third method based on applying the D-gap function to a regularized problem. Preliminary numerical experience is also reported. 相似文献
16.
Linfa Lu Xiaoyuan Qian Xiquan Shi Fengshan Liu 《Journal of Computational and Applied Mathematics》2011,236(5):916-923
In computer graphics and geometric modeling, shapes are often represented by triangular meshes (also called 3D meshes or manifold triangulations). The quadrangulation of a triangular mesh has wide applications. In this paper, we present a novel method of quading a closed orientable triangular mesh into a quasi-regular quadrangulation, i.e., a quadrangulation that only contains vertices of degree four or five. The quasi-regular quadrangulation produced by our method also has the property that the number of quads of the quadrangulation is the smallest among all the quasi-regular quadrangulations. In addition, by constructing the so-called orthogonal system of cycles our method is more effective to control the quality of the quadrangulation. 相似文献
17.
In this article, we propose a strongly convergent variant on the projected subgradient method for constrained convex minimization problems in Hilbert spaces. The advantage of the proposed method is that it converges strongly when the problem has solutions, without additional assumptions. The method also has the following desirable property: the sequence converges to the solution of the problem which lies closest to the initial iterate. 相似文献
18.
基于定性分析的方法,提出了有效累计时间的概念,建立了一种基于遗传算法的人力资源优化配置模型,为人力资源的优化配置提供了一种新的量化管理的具体方法,并进行了算例分析,证明了模型的有效性、实用性. 相似文献
19.
In this paper, a coupled Burgers’ equation has been numerically solved by a Galerkin quadratic B‐spline FEM. The performance of the method has been examined on three test problems. Results obtained by the method have been compared with known exact solution and other numerical results in the literature. A Fourier stability analysis of the method is also investigated. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
20.
《Journal of Computational and Applied Mathematics》2012,236(5):916-923
In computer graphics and geometric modeling, shapes are often represented by triangular meshes (also called 3D meshes or manifold triangulations). The quadrangulation of a triangular mesh has wide applications. In this paper, we present a novel method of quading a closed orientable triangular mesh into a quasi-regular quadrangulation, i.e., a quadrangulation that only contains vertices of degree four or five. The quasi-regular quadrangulation produced by our method also has the property that the number of quads of the quadrangulation is the smallest among all the quasi-regular quadrangulations. In addition, by constructing the so-called orthogonal system of cycles our method is more effective to control the quality of the quadrangulation. 相似文献