约束优化

The Hestenes-Powell augmented Lagrangian function has been used for solving inequality constrained optimization problems via unconstrained minimization techniques.

增广拉格朗日函数法是用无约束极小化技术求解约束优化问题的一类重要方法。

The function of each part of genetic algorithm is analyzed in application to nonlinear unconstrained and constrained optimization.

分析了遗传算法各主要组成部分的功能，研究了遗传算法在非线性无约束和等式约束优化问题中的应用。

In this paper, we succeed to generalize the modified BFGS update formula to constrained optimization problem.

本文将无约束问题的修正BFGS信赖域算法成功地应用于约束优化问题。

Taking the unknown coordinate in curved surface and curve as design variables, the equation of curved surface as constrained condition, and the distance between unknown coordinate as objective function, optimization is proposed to minimize the distance between curved surface and curve.

建立以曲面、曲线上未知，点坐标设计变量，以曲面和曲线方程为约束条件，以曲线和曲面距离为目标函数的约束优化方法来精确地确定曲面和曲线之间最短距离，同时确定获得最短距离对应的坐标点。

This is considered as a constrained optimization problem, and CUA employs L-BFGS-B, a limited memory quasi-Newton algorithm, to solve it.

CUA将展平或修正过程考虑为一个约束优化问题，然后采用适用于约束问题的有限内存拟牛顿法L-BFGS-B来求解。

In chapter 4, a sufficient condition for stability of time-delay T-S fuzzy systems subject to actuator saturation is first provided, and the problem of estimating the domain of attraction is also formulated.

第四章针对输入受约束的时滞T-S模糊系统，在系统参数确定的情况下，给出系统渐近稳定的充分条件，系统的吸引域的估计问题被转化为一个线性矩阵不等式形式的约束优化问题。

Then,by means of an unconstrained equivalent form of the criterion,a blind adaptive algorithm is given.

然后，利用约束优化问题的一个无约束条件的等价形式，给出盲多用户检测的自适应算法。

Through this model, which could make full use of the given prior information as the constraints of maximum likelihood estimation and based on Lagrange function, the calculation problem of fault prior probabilities was transformed to non-constrained optimization problem.

该模型以相关的先验信息作为最大概率估计的约束条件，并通过拉格朗日函数，将故障先验概率估算问题转化成无约束优化问题。

the classic inventory model is optimizing model of nonrestraint. but in fact, it is usually restricted by funds, warehouse's space, service rate etc. therefore, many inventory models of variable restriction are produced in succession.

经典的存贮模型是无约束优化模型，但在实际使用时，却往往受到资金、库容、服务率等条件的限制，因此，陆续产生了带有各种约束的存贮模型。

A general super memory gradient projection method was generalized to solve the nonlinear programming problems about the nonlinear equality constraints and in equality constraints by using general projection matrix.

利用广义投影技术，将求解无约束规划的超记忆梯度算法推广，建立了求解带非线性等式和不等式约束优化问题的一种超记忆梯度广义投影算法，并证明了算法的收敛性。

So that more consumers can enjoy more delicious quality, technology is even better than wine.

让更多的消费者可以品尝到品质更为鲜美，工艺更为精湛的葡萄酒。

Open it in your favorite text editor .

在你最喜爱的文本编辑器中将它打开。