排序方式: 共有81条查询结果,搜索用时 0 毫秒
1.
A systematic study of global properties of superheavy nuclei in the framework of the Liquid Drop Model and the Strutinsky shell correction method is performed. The evolution equilibrium deformations, TRS graphs and α-decay energies are calculated using the TRS model. The analysis covers a wide range of even-even superheavy nuclei from Z =102 to 122. Magic numbers and their observable influence occurring in this region have been investigated. Shell closures appear at proton number Z =114 and at neutron number N =184. 相似文献
2.
§ 1 IntroductionConsiderthefollowingnonlinearoptimizationproblem :minimizef(x)subjecttoC(x) =0 , a≤x≤b ,( 1 .1 )wheref(x) :Rn→R ,C(x) =(c1(x) ,c2 (x) ,...,cm(x) ) T:Rn→Rm aretwicecontinuouslydifferentiable,m≤n ,a ,b∈Rn.Trustregionalgorithmsareveryeffectiveforsolvingnonlinearoptimi… 相似文献
3.
4.
Nicholas I. M. Gould Dominique Orban Annick Sartenaer Phillipe L. Toint 《4OR: A Quarterly Journal of Operations Research》2005,3(3):227-241
In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and
update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms
can easily be improved by choosing appropriate parameters. Recommended ranges of values for these parameters are exhibited
on the basis of extensive numerical tests.
MSC classification:
65K05, 90C26, 90C30 相似文献
5.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
6.
Gai-di Li 《计算数学(英文版)》2005,23(5):463-478
In this paper,we present an algorithm for the CDT subproblem.This problem stemsfrom computing a trust region step of an algorithm,which was first proposed by Celis,Dennis and Tapia for equality constrained optimization.Our algorithm considers generalcase of the CDT subproblem,convergence of the algorithm is proved.Numerical examplesare also provided. 相似文献
7.
8.
首先利用Lagrange对偶 ,将球约束凸二次规划问题转化为无约束优化问题 ,然后运用单纯形法求解无约束优化问题 ,从而获得原问题的最优解 相似文献
9.
On the Global Convergence of a Projective Trust Region Algorithm for Nonlinear Equality Constrained Optimization 下载免费PDF全文
A trust-region sequential quadratic programming (SQP) method is developed and analyzed for the solution of smooth equality constrained optimization problems. The trust-region SQP algorithm is based on filter line search technique and a composite-step approach, which decomposes the overall step as sum of a vertical step and a horizontal step. The algorithm includes critical modifications of horizontal step computation. One orthogonal projective matrix of the Jacobian of constraint functions is employed in trust-region subproblems. The orthogonal projection gives the null space of the transposition of the Jacobian of the constraint function. Theoretical analysis shows that the new algorithm retains the global convergence to the first-order critical points under rather general conditions. The preliminary numerical results are reported. 相似文献
10.
Min-cut clustering 总被引:1,自引:0,他引:1
We describe a decomposition framework and a column generation scheme for solving a min-cut clustering problem. The subproblem to generate additional columns is itself an NP-hard mixed integer programming problem. We discuss strong valid inequalities for the subproblem and describe some efficient solution strategies. Computational results on compiler construction problems are reported.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.This research was supported by NSF grants DMS-8719128 and DDM-9115768, and by an IBM grant to the Computational Optimization Center, Georgia Institute of Technology. 相似文献