搜索资源列表
mixfun
- 基于等式约束和不等式约束的非线性规划的混合型惩罚函数优化方法-Based on equality and inequality constrained nonlinear programming mixed penalty function optimization
qpsubp
- 光滑牛顿法求解包含等式约束和不等式约束的二次规划子问题-solve sqp subproblem with Equality and inequality constraints by using Smoothing Newton Method
TrackRoute
- 用路径跟踪法求解不等式约束的凸二次规划，即沿着此路径(或邻域)可以逼近问题的最优解。-With the path tracking method for solving inequality constrained convex quadratic programming, that along this path (or neighborhood) can approximate the optimal solution of the problem.
interior-point-method-
- 程序为内点法，用来求解具有不等式约束条件的目标函数极值，用C开发的程序。-Program for the interior point method for solving the objective function extremum with inequality constraints, a program developed by C.
youhua-sheji
- 本案例为不等式约束最优化问题，采用罚函数法（内点法）。具体求解过程是用MATLAB编程求解的。-The Case for inequality constrained optimization problem using penalty function method (interior point method). Specific solution process is solved using MATLAB programming.
PSO-noncon
- 粒子群算法，可以计算含非线性不等式约束和等式约束的优化问题。-PSO algorithm can be calculated with nonlinear inequality constrained optimization problems and equality constraints.
On partial errors-in-variables models with inequality constraints of parameters and variables
- 不等式约束的Partial EIV 模型的算法研究。这是对总体最小二乘的拓展，是研究不等式约束总体最小二乘很好的文章。
EIV-models--
- 不等式约束的总体最小二乘算法研究，发表在被SSCI收入的国际测绘核心期刊Journal Of Geodesy上，是研究总体最小二乘的不可或缺的学习资料。-Overall inequality constrained least squares algorithm research, published in the international journal SSCI mapping core earnings Journal Of Geodesy, the study population l
minJSMixFun
- 多维目标函数的加速混合罚参数法，可解含不等式约束和等式约束问题。-The accelerated method of mixed penalty parameters for multidimensional objective function, the solvability problem with inequality constraints and equality constraints.
Midacomo
- MIDACO是一般的优化问题求解器。 MIDACO可应用于连续（NLP），离散/整数（IP）和混合整数（MINLP）的问题。问题可能被限制在平等和/或不等式约束。 MIDACO适合多达数百至几千优化变量的问题。 MIDACO实现了一个自由衍生物，启发式算法的处理方法处理的问题，因为黑盒可含有关键功能特性，如非凸性，不连续或随机噪声。-MIDACO is a solver for general optimization problems. MIDACO can be applied to con
minConPF
- 一个能运行的用罚函数法求解多维约束（等式约束和不等式约束都可以）极小值的matlab程序-A matlab program based on the penalty function method is used to solve the minimum of multidimensional constraint (include equality constraints and inequality constraints).
12
- 基于matlab对不等式约束的内点惩罚函数，-Penalty function based on matlab point within inequality constraints,
complex
- 本程序为任意维度的复合形程序（适用于解决含不等式约束的优化问题），只需修改相应的初始复合形、目标函数及约束条件等即可求出极小值。-This procedure for any dimension of complex procedures (applicable to solve the optimization problem with inequality constraints).The reader only needs to modify the corresponding initi
cplex124
- 在遇到一系列线性方程的时候 构造等式约束矩阵和不等式约束矩阵解线性规划(Solving linear programming)
matlab
- 设计并解决一个线性规划问题，要求： 1）问题应具有一定的实际背景，最好与自己的专业相关； 2）目标函数至少包含6个以上的变元； 3）包含等式约束和不等式约束两种约束条件； 4）写出求解问题的Matlab程序； 5）对求解的结果进行必要的解释和分析说明。(Design and solve a linear programming problem, requiring: 1) the problem should have a certain practical background,
mst
- 一个n元实函数在一组等式或不等式的约束条件下的极值问题(constraint condition)
ga
- 解线性约束、非线性约束和等式、不等式约束的函数极小值问题。可以求解rastrigin函数问题(Solving nonlinear constraint problems)
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 condition can be either an eq
lssvm工具箱
- LSSVM分类，LSSVM和SVM的区别就在于，LSSVM把原方法的不等式约束变为等式约束，从而大大方便了Lagrange乘子alpha的求解，原问题是QP问题，而在LSSVM中则是一个解线性方程组的问题。
PSO_yueshu
- 带有不等式/等式约束的加速粒子群算法（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)