搜索资源列表
constrain
- 基于改进粒子群算法的节能调度下多目标负荷最优分配 -Particle swarm optimization based on improved energy-saving scheduling optimal allocation under the multi-objective particle swarm optimization based on improved energy-efficient multi-objective scheduling optimal allocation
Constrain_Fuzzy_model_identification
- Constrain Fuzzy model identification的学习文件以及其模拟的源码。-Include "Constrain Fuzzy model identification" learning document and simulation matlab code.
fe_sdofID_2
- Purpose: build the ID array of system dofs to apply displacement constraints Synopsis: [csdof,sid]=fe_sdofID(discons,ndof,nnode) Variable Descr iption: csdof - the number of system dofs after constraints applied sid - ID matrix of
DOAmis
- 基于特征向量约束的波束形成算法例程，老外写的，对于多种波束形成算法的阵列增益等参数进行了详细的比较。-An beamforming example using feature vector constrain.
QP-asm
- 具有等式约束和不等式约束的二次规划问题，的积极集方法（有效集方法）-the active set methods for QP with equality and ineqality constrain
NEWTON
- 等式约束 Newton下降法 Matlab的实现-Newton descent method applied in equality constrain optimization and realized with Matlab
constrain-opt
- 针对工程优化设计问题,提出了基于混沌粒子群算法的工程约束优化问题求解方法。CPSO算法利用混沌搜 索的全局遍历性、随机性和规律性等特点, 引导粒子在全局范围内搜索, 从而克服了传统粒子群算法早熟收敛的缺点。 该算法以种群适应度方差作为粒子群优化算法早熟收敛的判据, 并用惩罚函数法处理违法约束的粒子, 当基本粒子群算 法陷入早熟时, 随机选择粒子群中的部分粒子实施混沌搜索, 直至满足迭代收敛条件为止。CPSO算法能提高种群的多 样性和粒子搜索的遍历性, 从而有效提高了PSO算法的收
PSOyouhua
- 粒子群优化算法优化无约束函数，其优化效果相当的不错，呵呵呵呵！-AVERAGE PSO Programs constrain gear Design
water_filling_algorithm
- 关于注水算法的简单演示。在总功率受限的情况下通过功率分配逼近香农信道容量-performs the water filling algorithm with the given total power constrain to approach Shannon capacity of the channel.
M_P_C
- MPC with and without constrain
Solving-Optimal-Power-Flow-with-Voltage-Constrain
- Solving Optimal Power Flow with Voltage Constraints using MATLAB Optimization Toolbox
Modified-lbest-PSO-on-GPU
- 这个是基于环形拓扑结构的约束微粒群算法，对原来的算法做了改进，只用到了一个邻居节点，效果与基本的微粒群算法大致相当。但是在对多模函数的计算上，优于基本的微粒群算法。这个算法的运行平台是GPUmat,需要的运行环境有：Matlab, GPU, GPUmat, Visual Studio.-This the modified particle swarm optimization algorithm that based on ring toplopy with constrain conditio
Huber
- 机器学习ADMM Huber损失最小化1范式约束算法Sparse Huber With L1 Constrain And Alternating Direction Method of Multipliers Method-Sparse Huber With L1 Constrain And Alternating Direction Method of Multipliers Method
trajectorygeneration
- 双S曲线轨迹规划，可用于两点之间最短时间规划，并且可以约束速度和加速度最大值(Hyperbolic S-curve trajectory planning, which can be used for the shortest time planning between two points, and can constrain the maximum speed and acceleration)