约束极小化的英文

• constrained minimization

• "约束"英文翻译    keep within bounds; restrain ...
• "化"英文翻译    change; turn; transform
• "无约束极小化" 英文翻译 :    unconstrained minimization
• "序贯无约束极小化技术" 英文翻译 :    sequential unconstrained minimization technique
• "序列无约束极小化方法" 英文翻译 :    sequential unconstrained minimization technique
• "顺序无约束极小化技术 sumt的意思相关词组" 英文翻译 :    sumt =sequential unconstrained minimization technique
• "极小化" 英文翻译 :    minimalization; minimization; minimize; minimizing
• "extremum约束极值" 英文翻译 :    extremum unter nebenbedingungen constrained
• "约束极大化" 英文翻译 :    constrained maximization
• "约束极值" 英文翻译 :    constrained extreme value; constrained extremum
• "比例极小化" 英文翻译 :    ratio minimization
• "产量极小化" 英文翻译 :    output minimizing
• "成本极小化" 英文翻译 :    cost minimization; costs minimization
• "风险极小化" 英文翻译 :    risk minimization
• "极小化层" 英文翻译 :    minimizing layer; minimizing level
• "极小化法" 英文翻译 :    minimizing method
• "极小化方程" 英文翻译 :    minimization equation
• "极小化过程" 英文翻译 :    minimization process
• "极小化求值" 英文翻译 :    short-circuit evaluation
• "极小化算法" 英文翻译 :    minimization algorithm
• "极小化条件" 英文翻译 :    minimization condition
• "极小化序列" 英文翻译 :    minimizing sequence
• "极小化最大" 英文翻译 :    minimax
• "损失极小化" 英文翻译 :    loss minimization
• "线性极小化" 英文翻译 :    linear minimization

• Application of sumt and ga to solving constrained nonlinear programming problem
  序列无约束极小化技术和遗传算法在非线性规划中的应用
• On the application of sumt and ga to solving constrained nonlinear programming problem
  序列无约束极小化技术和遗传算法在非线性规划中的应用
• It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
  我们知道，通过广义d -间隙函数，可以将变分不等式问题转化为一个无约束极小化问题。
• In this chapter , we consider the method of constrained equivalent formulation . we use the merit function based on the restrained ncp function and convert the origin problem ncp ( f ) to minimization problem which constrained on rn +
  我们在这一章里就考虑了ncp ( f )的约束极小化变形，通过限制的ncp函数来构造ncp问题的merit函数，将原始的问题ncp ( f )转化为(
• There have been many study about the unconstrained equivalent formulation . many algorithms and theories have been constituted about this kind of formulation . but to the constrained equivalent formulation , there is no corresponding algorithm
  无约束极小化变形的研究比较多，已经有了很多种算法，理论上也相对完备，但对于约束极小化变形，据作者所知，至今还没见过这方面的算法。
• Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming . at first , we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3
  首先针对前两章的对偶算法由于需要精确求解一系列无约束极小化问题，因而实际计算中很难实现这一缺点，构造修正的对偶算法，即，关于势函数的无约束极小化问题无需精确求解的对偶算法。
• The parameter control methods are very similar to penalty function methods , both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems . but parameter control methods are different from penalty function methods . firstly , the penalty coefficient of penalty function methods are preassigned , while the parameters of parameter control methodsare generated automatically according to some rule prescribed
  参数控制算法虽然与罚函数法非常类似，都是通过求解一系列无约束极小化问题来逼近约束优化问题的最优解，但罚函数法中的罚因子是预先设定的，而参数控制算法中的参数是自动产生的。
• In this article , we consider the methods for solving nonlinear complementarity problems from two aspects : one is the equivalent formulation of minimization , the other is the equivalence formulation of equation . to the former , we give a new derivative - free descent algorithm based on constrained minimization formulation . to the later , we construct a new homotopy equation and give its algorithm
  在本篇论文中，我们从两个方面考虑非线性互补问题的解决方法，一个是利用原始问题的极小化等价变形，给出了求解约束极小化问题的derivative - free下降算法；另一个是利用方程形式等价变形，构造了新的同伦方程并给出了相应的算法。
• By intro - ducing a penalty function as the following , for every e > 0 , we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem . the solutions of such a sequence of unconstrained minimization problems all exist , and they converge to the solution of the constrained minimization problem in a certain sense
  这列无约束极小化问题( p _ )的解都是存在的，并且在某种意义下收敛至原始约束极小化问题( p )的解，不仅如此，它们的性能指标也收敛至原始问题( p )解的性能指标。