In this paper we improve the simplex algorithm for quadratic programs , from algorithm to convergence conditions , and get simpler procedure and converging rules 摘要本文对二次规划的单纯形算法,从算法到收敛条件均加以改进,得到更简易的程序和收敛准则。
Fifthly , the parameter control methods for solving convex programming , especially linear programming and convex quadratic programming , are discussed and its convergence iv is probed 五是研究了凸规划包括线性规划和凸二次规划的参数控制算法及其收敛性。
Third , for the problem of the stress , local stability and displacement constraints , the sequential quadratic programming ( sqp ) method is adopted in this paper 第三,对于应力约束、局部稳定约束和位移约束的问题,本文采用序列二次规划sqp方法进行了求解。
This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed 本文分两部分,第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。
Finally the paper applies the contractive mapping genetic algorithm to search the equilibrium point of th neural network in a quadratic programming computing for the first time 在仿真计算中,首次将压缩映射遗传算法应用到了搜索th神经网络的平衡点(二次型的最优值)上。
The filter technique was first studied by fletcher and leyffer in the sequential quadratic programming ( sqp ) method for solving constrained optimization problems 本文研究了求解无约束最优化问题的newton -过滤器( newton - filter )算法。过滤器算法由fletcher - leyffer提出。
Thirdly , the principles of nurbs curve and surface are used to the modeling of complex object , and a protruding quadratic programming algorithm for reconstructing reference points of nurbs curve 第三,采用了nurbs曲线、曲面技术对复杂目标建模,给出了反求nurbs曲线控制点的凸二次规划算法。
This method searched along the edge of active constraints in quadratic programming , which would obtain available solution anytime in calculation and get the optimal solution more quickly 该算法使用等式约束二次规划变更指标沿积极约束边界搜索,可在计算中任何时候得到可行解,并较快得到最优解。
Finally , a case simulation and application in china aviation life - support research institute were developed in which a quadratic programming model was founded and solved by a two - phases method 最后,从中国航空救生研究所某制造车间提取了一个加工实例,建立了一个二次规划的数学模型,采用两步法进行求解。
Dual mathematical programming is used to map the original problem exactly and the second approximation of the dual problem is set up by taylor ' s expand form , it is solved by qp ( quadratic programming ) solving device 用对偶数学规划精确映射原问题,用泰勒展式建立对偶问题的二阶近似。最后用二次规划求解器求解。
Quadratic programming (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.