搜索资源列表
yueshuyouhua_vb
- 复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。
外点惩罚函数法－调试通过
- 求解n维具有不等式约束优化问题的最优解-solving n-dimensional inequality constrained optimization with the optimal solution
外点惩罚函数法－调试通过
- 求解n维具有不等式约束优化问题的最优解-solving n-dimensional inequality constrained optimization with the optimal solution
yueshuyouhua_vb
- 复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。-Complex method of inequality constrained optimization. One of the main program is commonly used, as long as the amendments to its own objective function and constraint conditio
Interior_point_method
- 内点法是从可行域内某一初始内点出发，在可行域内进行迭代的序列极小化方法。它仅用于求解不等式约束优化问题。这里列出内点惩罚函数法的六个子程序。 -Interior point method is a feasible region within the initial point of view, the region, where feasible, to carry out the sequence of iterative mi
Convex11
- Matlab采用障碍法及原对偶内点法解决不等式约束凸优化问题-barry method, Original dual interior point method
example
- 遗传算法实例：生成初始种群：遗传优化算法搜索；将不等式约束作为惩罚项加入适应度函数-Genetic algorithm example
matlab
- 程序为matlab编程的求解约束优化软件，适用于求解等式约束和不等式约束情况；-Matlab program for solving constrained optimization software, suitable for solving equality constraints and inequality constraints
mixfun
- 基于等式约束和不等式约束的非线性规划的混合型惩罚函数优化方法-Based on equality and inequality constrained nonlinear programming mixed penalty function optimization
Matlabrule
- 用matlab编程求解无约束优化问题、线性规划问题即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题-Matlab programming for solving unconstrained optimization problems, linear programming problems that most value problem for a linear function under the constraints
SQP_local_eqineqz
- 用matlab编写的SQP优化函数。可以求解目标函数和约束函数（等式和不等式）都为非线性的优化问题。-SQP solving function
PSO-noncon
- 粒子群算法，可以计算含非线性不等式约束和等式约束的优化问题。-PSO algorithm can be calculated with nonlinear inequality constrained optimization problems and equality constraints.
Midacomo
- MIDACO是一般的优化问题求解器。 MIDACO可应用于连续（NLP），离散/整数（IP）和混合整数（MINLP）的问题。问题可能被限制在平等和/或不等式约束。 MIDACO适合多达数百至几千优化变量的问题。 MIDACO实现了一个自由衍生物，启发式算法的处理方法处理的问题，因为黑盒可含有关键功能特性，如非凸性，不连续或随机噪声。-MIDACO is a solver for general optimization problems
complex
- 本程序为任意维度的复合形程序（适用于解决含不等式约束的优化问题），只需修改相应的初始复合形、目标函数及约束条件等即可求出极小值。-This procedure for any dimension of complex procedures (applicable to solve the optimization problem with inequality constraints).The reader only needs to
增广拉格朗日
- 常用的解决不等式约束优化问题的放法，增广拉格朗日方法等(The commonly used method of solving inequality constrained optimization problems, augmented Lagrange method and so on)
constrained optimization
- 主要解决在自变量满足约束条件的情况下的目标函数最小化问题，其中约束条件既可以是等式约束也可以是不等式约束。(It mainly solves the problem of minimizing the objective function under the condition that the independent variables satisfy the constraint conditions. The constraint