Description: 这个是优化方法中的一种方法，叫做罚函数法，是一种用于带约束条件的优化。-This optimization method is a method, called the penalty function method, is a condition for constrained optimization. Platform: |
Size: 3072 |
Author:宝宝 |
Hits:
Description: 内点法是从可行域内某一初始内点出发，在可行域内进行迭代的序列极小化方法。它仅用于求解不等式约束优化问题。这里列出内点惩罚函数法的六个子程序。
-Interior point method is a feasible region within the initial point of view, the region, where feasible, to carry out the sequence of iterative minimization method. It is only used for solving inequality constrained optimization problem. Listed here point penalty function method within the six subroutines. Platform: |
Size: 3072 |
Author:lrc |
Hits:
Description: 罚函数方法是求解约束（极小）优化问题的一类较好的算法。其基本思想：根据约束的特点构造某种惩罚函数，并把惩罚函数添加到目标函数上去，从而得到一个增广目标函数，使约束优化问题的求解转化为一系列无约束极小优化问题的求解。-Penalty function method for solving constrained (minimum) optimization problem of a class of better algorithms. The basic idea: In accordance with the characteristics of structure bound by a penalty function and penalty function to add up to the objective function in order to get an augmented objective function, so that the solution of constrained optimization problems into a series of unconstrained optimization problems to solve . Platform: |
Size: 3072 |
Author:szl |
Hits:
Description: 约束优化方法—惩罚函数法的c++源程序，可用于三维变量。-Constrained optimization methods- penalty function method of c++ source code, can be used for three-dimensional variable. Platform: |
Size: 397312 |
Author:彬 |
Hits:
Description: 可用于有约束函数优化的竞赛争冠算法程序已基本完成,但肯定还有未发现的问题.请您试用,并提宝贵的意见和批评.谢谢!该程序是在自创的无约束优化的竞赛争冠算法(旧称竞技取冠算法)函数优化程序基础上,开发出来的有约束优化程序.程序采用罚函数法实现有约束优化的,但罚因子(惩罚系数)的处理方法有别于其它罚函数法.该程序证明这种惩罚系数处理方法是有效的.该法调整惩罚系数简单,粗放,一般应用默认值即可.该程序普适性较好,进化参数调整简单,不敏感,全局最优解的搜索能力较强,数据重现性(鲁棒性)较好,获得结果精度较高,不足是有时评价函数调用次数稍多些.<进化记录>.txt记录进化全程.其中有惩罚项值和约束值数据记录,有助于指导有约束优化的进行.可看出所得解是可行解或是不可行解?那些约束是激活的(stexp>=a变stexp-a>=0 或是 stexp<=b变stexp-b<=0观察)?-Can be used for constrained function optimization algorithm for the race program has basically completed the title race, but certainly there are no problems found. Please try and provide valuable advice and criticism. Thank you!
The program is a self-designed race champion, unconstrained optimization algorithm (formerly known as competitive access crown algorithm) based on function optimization procedure, developed in a constrained optimization procedure. Program uses penalty function to achieve optimal binding, but the penalty factor (penalty factor) approach is different from other penalty function. The program proved such a penalty factor approach is valid. to adjust the penalty factor method is simple, extensive, general application of the default values can be. the program more universal Well, evolution parameter adjustment simple, sensitive, global optimal solutions of strong search capabilities, data reproducibility (robustness) better access to accurate result is sometimes Platform: |
Size: 1608704 |
Author:Xu Feng Xiang |
Hits:
Description: 设计特定的进化操作或约束修正因子。文献[ 28 ]采用罚函数法,利用非固定多段映射罚函数对约束优化问题进行转化,再利用PSO求解转化后的问题,仿真结果显示PSO相对进化策略和遗传算法有优越性,但其罚函数的设计过于复杂,不利于求解-Operation or design of the evolution of specific binding correction factor. Literature [28] The penalty function method, using non-stationary multi-stage fine mapping function to transform constrained optimization problem, and then transformed using PSO to solve the problem, simulation results show that PSO is relatively evolution strategy and genetic algorithm has advantages, but the penalty function The design is too complex and not conducive to solving Platform: |
Size: 2048 |
Author:杨科 |
Hits:
Description: 罚函数法将有约束优化问题转变成另一种形式，人后通过解一个序列的无约束极小问题求出原问题的最优解-Penalty function will be constrained optimization problem into another form, one after the solution through a sequence of unconstrained minimax problems find the optimal solution of original problem Platform: |
Size: 1024 |
Author:manzi |
Hits:
Description: 外点罚函数方法，可以用来求解约束优化问题，也可以用来被调用在智能算法中-Point outside the penalty function can be used for solving constrained optimization problems, can also be used in intelligent algorithm called Platform: |
Size: 3072 |
Author:彭ph.D |
Hits:
Description: 解优化问题时常用的惩罚函数法，分为内点法和外点法两种，求解约束优化问题最优值。-Penalty function method, including interior point method and exterior point method, to solve the optimal value of constrained optimization problems. Platform: |
Size: 28672 |
Author:gaoshanliushui |
Hits:
Description: 将离散约束优化问题转化为非负整数约束规划问题，开发求解该问题的离散差分进化算法。该算法采用基于混沌映射
的种群初始化、双版本变异和带随机扰动项的取整运算等新策略。针对非线性约束条件，给出惩罚基数的计算方法和连续映
射基函数的表达式，在此基础上设计处理非线性约束的自适应惩罚因子。提出一种刻画种群多样性的新测度——种群二次平
均基因距离及基于新测度的依概率混沌移民算子。将自适应罚函数法、依概率混沌移民操作与离散差分进化算法有机融合，
构造面向工程约束优化的混合离散差分进化算法。对 3 个离散约束优化实例进行验证，结果表明，混合算法具有良好的鲁棒
性且优于离散粒子群算法。应用混合算法求解斜齿圆柱齿轮传动优化设计问题，结果优于遗传算法及其改进算法、离散粒子
群算法，目标函数值较遗传算法及其改进算法分别下降41 和10-The constrained discrete optimization (CDO) is transfor med into a nonlinear constrained non-negative integer
programming (CNIP) which can be solved by the proposed discrete differential evolution (DDE) algorithm that adopts several
improvements such as the chaotic initialization of a population, the double-scheme mutation, and the integrating operator with
stochastic perturbation. Aiming at the nonlinear constraints, th e calculating approaches for the base penalty and the formula f or the
base function of continuous mapping are carried out, and self-adaptive penalty factors based on these notions for handling cons traints
are presented. It is studied that a novel measure, termed as a quasi re-averaging gene distance for a population, is employed t o depict
the diversity of the population and chaotic immigration operato rs depending on this measure a nd the probability are implemented to
preserve the population diversity. Orientating constrained engineering optimizati Platform: |
Size: 927744 |
Author:吴胜亮 |
Hits:
Description: 约束优化问题，包含
用Rosen梯度投影法求解约束多维函数的极值
用外点罚函数法求解线性等式约束多维函数的极值
用外点罚函数法求解一般等式约束多维函数的极值
用内点罚函数法求解约束多维函数的极值
用混合罚函数法求解约束多维函数的极值
用混合罚函数加速法求解约束多维函数的极值
用乘子法求解约束多维函数的极值
用坐标轮换法求解约束多维函数的极值
用复合形法求解约束多维函数的极值
-Constrained optimization problems containing Rosen gradient projection method for solving constrained multi-dimensional functions the extremal with outside point penalty function method for solving linear equality constraints multidimensional function extreme outside point penalty function method for solving general the equality constraints multidimensional function extremum interior point penalty function method for solving constrained multidimensional function extremum with mixed penalty function method for solving constrained multidimensional function extremum with mixed penalty function accelerated method for solving constrained multidimensional function extremum multiplier method for solving constrained multidimensional function extremum with coordinate rotation method for solving constrained multi-dimensional function the extremal complex method for solving constrained multidimensional function extremum Platform: |
Size: 4096 |
Author:张然 |
Hits:
Description: 惩罚函数法C语言相关程序
它将有约束最优化问题转化为求解无约束最优化问题：其中M为足够大的正数， 起"惩罚"作用， 称之为罚因子，F(x, M )称为罚函数。-Penalty Function Method C language-related program it would have constrained optimization problem is transformed into solving unconstrained optimization problem: where M is a sufficiently large positive number, from the " punishment" effect, called the penalty factor, F (x, M) called the penalty function. Platform: |
Size: 1024 |
Author:李志强 |
Hits:
Description: 《最优化方法及其Matlab程序设计》较系统地介绍了非线性最优化问题的基本理论和算法，以及主要算法的Matlab程序设计，主要内容包括（精确或非精确）线搜索技术、最速下降法与（修正）牛顿法、共轭梯度法、拟牛顿法、信赖域方法、非线性最小二乘问题的解法、约束优化问题的最优性条件、罚函数法、可行方向法、二次规划问题的解法、序列二次规划法等。-" Optimization Methods and Matlab programming," a more systematic introduction to nonlinear optimization problem of the basic theory and algorithms, as well as the main algorithm Matlab programming, the main contents include (precise or exact) line search technique, the steepest descent method and (amended) Newton method, conjugate gradient method, quasi-Newton method, trust region method, nonlinear least squares problem solution, constrained optimization problems optimality conditions penalty function method, feasible direction method, quadratic programming problem The solution, sequential quadratic programming method. Platform: |
Size: 1792000 |
Author:赵雪伟 |
Hits:
Description: 本书较为系统地介绍了非线性最优化问题的基本理论和算法及主要算法的matlab程序设计，主要内容包括线搜索技术，最速下降法与牛顿法，共轭梯度法，拟牛顿法，信赖域方法，非线性最小二乘问题的解法，约束优化问题的最优性条件，罚函数法，可行方向法，二次规划问题的解法，序列二次规划法等。-This book systematically introduces the nonlinear optimization problem of the basic theory and algorithms and key algorithm matlab program design, including line search technique, the steepest descent method and Newton' s method, conjugate gradient method, quasi-Newton method, trust region method, nonlinear least squares problem solution, constrained optimization problems optimality conditions penalty function method, feasible direction method, the solution of quadratic programming problems, sequential quadratic programming method. Platform: |
Size: 7461888 |
Author:whucs |
Hits:
Description: 包含所有约束优化问题中涉及的matlab源程序。包含Rosen梯度法求解约束多维函数的极值，外点罚函数法解线性等式约束，外点罚函数法解一般等式约束，内点罚函数法，混合罚函数法，混合罚函数加速法，乘子法，坐标轮换法及复合形法-Contains all the constrained optimization problem involves matlab source. Contains Rosen gradient method for solving constrained multi-dimensional function extremum, external point penalty function method for solving linear equality constraints, external point penalty function method for solving general equality constraints, interior point penalty function method, mixed penalty function method, mixed penalty function acceleration method , multiplier method, the coordinate rotation method and complex method Platform: |
Size: 7168 |
Author:陈陈 |
Hits:
Description: 现代设计理论中涉及的一些常用的优化设计方法，如一维搜索（黄金分割、二次差值等）、无约束优化方法（梯度法、牛顿法等）、约束优化方法（复合形法、DFP、惩罚函数法等）。-Some commonly used method for optimizing the design of modern design theory involved, as one-dimensional search (golden section, the second difference, etc.), unconstrained optimization methods (gradient method, Newton method, etc.), constrained optimization methods (complex method, DFP, penalty function method, etc.). Platform: |
Size: 17408 |
Author:王希 |
Hits:
Description: 约束优化问题，主要包括坐标轮换法，外点罚函数法，混合罚函数法，加速混合罚函数法，梯度投影法，乘子法-Constrained optimization problems, including the method of coordinate rotation, the outer points penalty function method, mixed penalty function method, accelerating hybrid penalty function method, the gradient projection method, multiplier method Platform: |
Size: 4096 |
Author:cyj |
Hits:
Description: 带有不等式/等式约束的加速粒子群算法（apso），主要通过罚函数来进行约束，速度较快，可处理带约束问题(Accelerated particle swarm optimization (APSO) with inequality / equality constraints, which is mainly constrained by penalty function, is fast and can deal with constrained problems) Platform: |
Size: 1024 |
Author:Ricardo1 |
Hits:
Search - Constrained Optimization penalty function