共查询到20条相似文献,搜索用时 0 毫秒
1.
Ming-ming Li You-lin Shang Lian-sheng Zhang 《计算数学(英文版)》2006,24(1):25-32
The Filled Function Method is a class of effective algorithms for continuous globaloptimization.In this paper,a new filled function method is introduced and used to solveinteger programming.Firstly,some basic definitions of discrete optimization are given.Then an algorithm and the implementation of this algorithm on several test problems areshowed.The computational results show the algorithm is effective. 相似文献
2.
本文提出了一种整数规划中的指数一对数对偶.证明了此指数-对数对偶方法具有的渐近强对偶性质,并提出了不需要进行对偶搜索来解原整数规划问题的方法.特别地,当选取合适的参数和对偶变量时,原整数规划问题的解可以通过解一个非线性松弛问题来得到.对具有整系数目标函数及约束函数的多项式整规划问题,给出了参数及对偶变量的取法. 相似文献
3.
整数规划的一类填充函数算法 总被引:9,自引:0,他引:9
填充函数算法是求解连续总体优化问题的一类有效算法。本文改造[1]的填充函数算法使之适于直接求解整数规划问题。首先,给出整数规划问题的离散局部极小解的定义,并设计找离散局部极小解的领域搜索算法。其次,构造整数规划问题的填充函数算法。该方法通过寻找填充函数的离散局部极小解以期找到整数规划问题的比当前离散局部极小解好的解。本文的算法是直接法,数值试验表明算法是有效的。 相似文献
4.
本文得到判别已知可行整值点为凸整数规划最优解的一个充分条件,此条件只涉及目标函数在该整值点为中心的边长为2的超立方体上的性态. 相似文献
5.
在中国,决策者常常须在满足一定的均衡条件下从许多替代方案中选出一个最佳方案。本文提出了一个整数规划模型来描述这类问题,同时也给出了该模型的算法. 相似文献
6.
离散填充函数是一种用于求解多极值优化问题最优解的一种行之有效的方法.已被证明对于求解大规模离散优化问题是有效的.本文基于改进的离散填充函数定义,构造了一个新的无参数填充函数,并在理论上给出了证明,提出了一个新的填充函数算法.该填充函数无需调节参数,而且只需极小化一次目标函数.数值结果表明,该算法是高效的、可行的. 相似文献
7.
8.
Wenjuan Xue & Weiai Liu 《计算数学(英文版)》2020,38(5):683-704
We propose a multidimensional filter SQP algorithm. The multidimensional filter technique proposed by Gould et al. [SIAM J. Optim., 2005] is extended to solve constrained
optimization problems. In our proposed algorithm, the constraints are partitioned into
several parts, and the entry of our filter consists of these different parts. Not only the criteria for accepting a trial step would be relaxed, but the individual behavior of each part
of constraints is considered. One feature is that the undesirable link between the objective function and the constraint violation in the filter acceptance criteria disappears. The
other is that feasibility restoration phases are unnecessary because a consistent quadratic
programming subproblem is used. We prove that our algorithm is globally convergent to
KKT points under the constant positive generators (CPG) condition which is weaker than
the well-known Mangasarian-Fromovitz constraint qualification (MFCQ) and the constant
positive linear dependence (CPLD). Numerical results are presented to show the efficiency
of the algorithm. 相似文献
9.
Duoquan Li 《计算数学(英文版)》2006,24(5):609-634
In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method, the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient. 相似文献
10.
本文提出了一种整数规划中的指数-对数对偶.证明了此指数-对数对偶方法具有的渐近强对偶性质,并提出了不需要进行对偶搜索来解原整数规划问题的方法.特别地,当选取合适的参数和对偶变量时,原整数规划问题的解可以通过解一个非线性松弛问题来得到.对具有整系数目标函数及约束函数的多项式整规划问题,给出了参数及对偶变量的取法. 相似文献
11.
1引言 科学和工程领域中的许多优化问题最终可以归结为求解一个带有约束条件的整数规划问题.其形式为: {maxx∈In f(x) s.t.gi(x)=0,j=1,…,me; gi(x)≥0,i=me+1,…m, x∈nΠi=1 Ai, 式中I表示整数集,x=(x1,…,xn)T,Ai(i∈{1,…,n})为有限整数集. 遗传算法作为一种优化技术,是一种近似算法,一般不能保证一定能得到优化问题的精确解. 相似文献
12.
Qin Ni 《计算数学(英文版)》2001,(4)
1. IntroductionConsider the following NLP problemwhere the function f: Re --+ RI and gi: Re - R', j E J are twice continuously dtherentiable.In particular, we discuss the cajse, where the nUmber of variables and the nUmber of constraintsin (1.1) are large and second derivatives in (1.1) are sparse.There are some methods whiCh can solve largesscale problems, e.g. Lancelot in [2] andTDSQPLM in [9]. But they can not take adVantage of sparse structtire of the problem. A newefficient meth… 相似文献
13.
本文提出了一个指数型凸化,凹化变换,并证明了单调非线性规划总能变换成相应的凹规划或凸规划.还证明了带某种类型线性或非线性约束的非线性规划在适当条件下能变换成单调非线性规划. 相似文献
14.
15.
Xin-wei Liu 《计算数学(英文版)》2001,(3)
1. Introductioncrust region methods are iterative. As a strategy of globalization, the trust region approach was introduced into solving unconstrained optimization and proved to be efficient androbust. An excellent survey was given by Mor6(1983). The associated research with trustregion methods for unconstrained optimization can be found in Fletcher(1980), Powell(1975),Sorensen(1981), Shultz, Schnabel and Byrd(1985), Yuan(1985). The solution of the trust region subproblem is still an activ… 相似文献
16.
本文揭示了关于非线性规划问题的同伦算法与外点罚函数法的关系,并讨论了有关同伦算法的收敛条件,给出了一些典型的检验问题的计算结果以表明利用结构的分段线性同伦算法的有效性。 相似文献
17.
二次半定规划问题及其投影收缩算法 总被引:1,自引:0,他引:1
In this paper,we discuss the relations among the quadratic semi-definite programming problem,the linear semi-definite porgramming and the linearquadratic semi-definite programming problem.The duality theories are presented.After proving the equivalence of its optimality conditions and monotonous linear variational inequalities,we use the projection and contraction algorithms to solve(QSDP),We present the algorithms and its convergence analysis. 相似文献
18.
This paper describes a primal-dual interior paint algorithm for convex nonlinear programming problems subject to linear constraints. The algorithm is based on the path following idea. Each iteration updates a penalty parameter and finds a Newton step associated with the simplified Karush-Kuhn-Tucker system of equations which characterizes a solution of the logarithmic barrier function problem for that parameter. It is shown that the duality gap if reduced at each iteration by a factor of (1 - δ / n~(1/n) ), where S is positive and depends on some parameters associated with the objective function. 相似文献
19.
20.
1引言随机规划中的概率约束问题在工程和管理中有广泛的应用.因为问题中包含非线性的概率约束,它们的求解非常困难.如果目标函数是线性的,问题的求解就比较容易.给出了一个求解随机线性规划概率约束问题的综述.原-对偶算法和切平面算法是比较有效的.在本文中,我们讨论随机凸规划概率约束问题: 相似文献