搜索资源列表
-
0下载:
有效集法利用数学规划的对偶理论,将所求双层规划转化为一个下层只有一个无约束凸二次子规划的双层规划问题.然后根据两个双层规划的最优解和最优目标值之间的关系,提出一种简单有效的算法来解决非增值型凸二次双层规划问题.-Quadratic Bilevel Programming
-
-
0下载:
内点法求解凸二次规划
COPL_QP是一个可用的凸二次规划实验的解。这个软件包试图解决线性约束凸二次规划。源代码用C语言编写,附带用户指南(postscr ipt文件)和问题实例-Interior point method for solving convex quadratic programming
-
-
1下载:
Visual Studio 2005 环境下,C++ 实现的求解凸二次规划的算法源代码。-a C++ implementing algorithm for a (convex)
Quadratic Programming problem by means of an active-set dual method.
-
-
0下载:
很优秀的优化仿真二次规划算法;很优秀的优化仿真二次规划算法-quadratic programming;quadratic programming;quadratic programming;quadratic programming;
-
-
0下载:
二次规划的lemke解法(适用于少参数问题)-Lemke solution of quadratic programming (less parameters)
-
-
0下载:
solves a convex quadratic programming problem.
-
-
0下载:
好用的二次规划算法,我一直在用,非常推荐-Easy to use quadratic programming algorithm, I have been very recommended
-
-
0下载:
主要用于数学上二次规划,简明易了,适合初学者-quadratic programming
-
-
1下载:
常用的最优化方法,包括SQP方法,二次规划,信赖域方法,共轭梯度法等-Commonly used optimization method, including the SQP method, quadratic programming, trust region method, conjugate gradient method
-
-
0下载:
二次规划问题可以以下形式来描述:. f(x)=(1/2)x^TQx + ... 如果有至少一个向量x满足约束而且f(x)在可行域有下界,二次规划问题就有一个全局最小值x。-Quadratic programming problem can be described by the following form:. F (x) = (1/2) x ^ TQx+ ... if there is at least one vector x satisfies the constraints and f
-
-
1下载:
非常好的关于序列二次规划的外文文章,对SQP算法学习非常有帮助-Very good on the sequential quadratic programming foreign language articles on SQP algorithm learning very helpful
-
-
0下载:
本算法是基于数值计算中的二次规划编写的MATLAB程序。非常实用的一个小程序。-This algorithm is based on the numerical calculation of quadratic programming written MATLAB program. Very practical one small program.
-
-
2下载:
二次规划的matlab程序,希望对初学者有用- Quadratic Programming
-
-
0下载:
线性规划:
CmpSimpleMthd(完整单纯形法)
整数规划(含0-1规划)
DividePlane(割平面法)
ZeroOneprog(枚举法)
二次规划
QuadLagR(拉格朗日法)
ActivedeSet(起作用集法)-Linear Programming:
CmpSimpleMthd (complete simplex method)
Integer programming (including 0-1 Programming)
Divide
-
-
1下载:
二次规划师非线性优化中的一种特殊情形,它的目标函数是二次实函数,约束函数都是线性函数。由于二次规划比较简单,便于求解(仅次于线性规划),并且一些非线性优化问题可以转化为求解一些列的二次规划问题,因此二次规划的求解方法较早引起人们的重视,称为求解非线性优化的一个重要途径。二次规划的算法较多,本文仅介绍求解等式约束凸二尺规划的拉格朗日方法以及求解一般约束凸二次规划的有效集方法。-Quadratic nonlinear optimization planners in a special case,
-
-
0下载:
共轭梯度法求解凸二次规划,代码由C语言开发,老外编写的程序,很值得一读。-Conjugate gradient method for solving convex quadratic programming, code generated by C language development, foreigners prepared program, it is worth reading.
-
-
2下载:
带等式约束和边界约束的凸二次规划问题,程序包含两种方法,一种是共轭梯度法,一种是frank-wolfe算法,代码质量较高。-Convex quadratic programming problem with equality constraints and boundary constraints, the program contains two methods, one is the conjugate gradient method, one is frank-wolfe algorith
-
-
0下载:
The Simulation Code for Solving Constrained Optimization Problems based on Sequential Quadratic Programming (SQP) Method.
-
-
0下载:
Sequential Quadratic Programming algorithm
-
-
0下载:
功能:用拉格朗日方法求解等式约束二次规划:min f(x)=0.5*x Hx+c x,s.t.Ax=b
输入:H,c分别是目标函数的矩阵和向量,A,b分别是约束条件中的矩阵和向量
输出:(x,lam)是KT点,fval是最优值。-Function: Lagrangian method for solving equality constrained quadratic programming: min f (x) = 0.5* x Hx+ c x, s.t.Ax = b
Input:
-