搜索资源列表
liyingnan_3
- 解线性规划，等式约束和不等式约束均有，得到附和约束条件的一组最优解。-linear programming solution, equality and inequality constraints have been echoed by a restrictive conditions Optimal Solutions Group.
RanMethod
- 随机搜索法,用于大型复杂优化问题.该方法只支持变量的范围约束,不支持其它类型的约束.-random search method for large complex optimization problems. The only support the scope of variables bound not to support other types of constraints.
GNMF
- 菜登和何晓飞, 2010的PAMI 基于图的非负矩阵分解的paper极其matlab代码。这篇文章在非负矩阵分解中巧妙地加入了流形约束，并推导出了相应的迭代公式。-He Xiaofei Teng and vegetables, 2010 PAMI graph-based non-negative matrix factorization of the paper is extremely matlab code. This article in the non-negative matrix
dynopt_4.1.3
- 基于Biegler动态优化正交配置法（联立算法）的matlab 代码，由M.Cizniar，M. Fikar等编写-dynopt is a set of MATLAB functions for determination of optimal control trajectory by given descr iption of the process, the cost to be minimised, subject to equality and inequality const
kexingfangxiangfa
- 线性约束条件的只需一次迭代的可行方向法。-Linear constraints only the first iteration of the feasible direction method.
simplex_algorithm
- 单纯形算法源程序，具有选择是求解目标值的最大还是最小问题，同时也具有可行性变量约束限制-Simplex algorithm source with the target choice is to solve the biggest problem is still the smallest, but also with the feasibility of variable binding constraints
LINGO9_green_crack
- 完全破解绿色精简版LINGO9，无变量限制-Green Starter Edition full crack LINGO9, non-variable constraints
ConstrKF
- kalman filter with state constraints lecture and example
12
- 该LINGO程序的功能是：求出工程项目的收益的净现值和每道工序的最优开工时间，约束条件是紧前紧后约束，以及资源约束-The program' s function is LINGO: the project proceeds to derive the net present value of each procedure and the optimal start time constraints are tight after the former tight constraints,
danchunxing
- 单纯形法在自动配煤系统中的应用。以配煤价格为目标，灰分、水分、硫分为约束条件，求解最优配比。由于方程具有通用性，也可用于其他行业。-Simplex method in the automatic blending system. Coal prices in the objective, ash, moisture, sulfur is divided into constraints, solving the optimal ratio. Since the equation has the
levmar-2.1.2
- 求算非线性最小二乘问题的经典算法。Levenberg-Marquardt算法。-This is levmar, a copylefted C/C++ implementation of the Levenberg-Marquardt non-linear least squares algorithm. levmar includes double and single precision LM versions, both with analytic and finite differ
simplex_method_larger
- 线性规划问题求解（约束条件均为大于，最后N列为单位矩阵）-Solving linear programming problems (constraints are greater than and the last N as a unit matrix)
Scheduling_Scientific_Workflow_Applications_with_
- Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models, which are capable of supporting diverse computing services. It facilitates scientific applicat
dw_clase
- This program solves linear programming problems with complicating constraints using the Dantzig-Wolfe decomposition. Gams code.-This program solves linear programming problems with complicating constraints using the Dantzig-Wolfe decompo
TOTALVARIATIONRESTORATIONFREECONSTRAINTS
- TOTAL VARIATION BASED IMAGE RESTORATION WITH FREE LOCAL CONSTRAINTS.
Differential_Evolution2
- 优化设计算法：用微分进化法求目标函数的最优解和最优值，有约束条件，已经验证算法的正确性，visual C++6.0开发-Optimization Algorithm: Differential Evolution Method with the objective function of the optimal solution and optimal value, there are constraints, has verified the correctness of the algori
Lsub1approximation
- L1 solution to linear equations subject to linear equality and inequality constraints
greedyjs
- 贪心算法之带有限期的作业排序。应用贪心设计策略解决操作系统中单机、无资源约束且每个作业可以在等量的时间内完成的作业调度问题。-Greedy Algorithm for Scheduling with deadline. Application greedy single operating system design strategy to solve, no resource constraints and each job can be completed within the same a
sba
- Constrained SBA. Useful for camera error minimization with soft constraints on camera parameters.
constraints
- 根据模式将得到tau的线性化限制。 模式包括: one of euclidean , euclidean_notranslation , affine , affine_notranslation , homography 。-constraints() will get the linearize constraints of tau according to mode.