片语

convex concave programming凸凹规划

convex optimization凸规划

convex fuzzy programming凸模糊规划

unconstrained convex quadratic programming无约束凸二次规划

convex nonsmooth programming凸不可微规划

strict convex quadratic programming严格凸二次规划

separable convex quadratic programming可分凸二次规划

convex nonlinear programming凸非线性规划

convex quadratic programming[数]

convex multiobjective programming凸多目标规划

英汉例句

• a linear convex programming algorithm for solving this kind of mixed control problem is given in terms of linear matrix inequality(lmi).

  基于线性矩阵不等式（lmi）方法，给出了该问题的线性凸优化解法。

• a new globally convergent method of moving asymptotes (gcmma) is worked out based on the method of moving asymptotes (mma) belonging to convex programming methods.

  将传统凸规划方法中的移动渐近线方法（mma）推广到连续体的结构拓扑优化设计中，并形成一种新的具有全局收敛特点的移动渐近线方法（gcmma）。

• this paper sets up a dual problem for nondifferentiable convex programming with equality constraints and proves the weak duality and strong duality.

  本文对非可微凸规划问题建立了一个新的对偶问题 ，并证明其对偶性质 ，如弱对偶性 ，强对偶性及逆对偶性。

• moreover, an approach is obtainedtodesigncontrollervia convex programming algorithm such that the closed loop system is espr and has maximum perturbation bound under the method.

  通过凸优化算法，得到了所提出方法意义下具有最大摄动界的espr控制器设计方法。

• this paper presents a primal-dual infeasible interior point algorithm for differentiable convex programming problem with box constraints, and prove that algorithm enjoys the global convergence.

  对框式约束的可微凸规划提出了一个原始-对偶不可行内点算法，并证明了算法的全局收敛性。

• in convex programming theory, a constrained optimization problem, by kt conditions, is usually converted into a mixed nonlinear complementarity problem.

  在凸规划理论中，通过kt条件，往往将约束最优化问题归结为一个混合互补问题来求解。

• the optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.

  采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型。通过经典算例验证了本方法的有效性。

• the paper offers a dual problem for the semi-infinite convex programming by using the directional derivative with zero dual gap.

  本文对半无限凸规划提出一个用方向导数表述的对偶问题，其对偶间隙为零。

• the first two cases can be converted into quadratic model or convex programming problem with quadratic constraint, but the third one is a nonconvex programming problem.

  将该模型的计算转化为求解一个凸二次规划问题，不仅保证了解的唯一性和存在性，还使得该方法能够用于大规模混合输电权市场中的竞价策略分析。

• resultstwo primal neural-network models for solving a class of linearly constrained convex programming problems are proposed by means of their inherent properties and the projection method.

  结果基于问题自身的结构特点和射影方法，提出了求解一类线性约束非线性凸规划的两个神经网络模型。

• aimto construct the simple and feasible neural networks for solving a class of linearly constrained convex programming problems.

  目的建立求解一类线性约束非线性凸规划的简单可行的神经网络。

• this paper considers a convex programming with an additional reverse convex constraint. a kind of conical branch and bound method is developed and convergence conditions are obtained.

  考虑了一种带有反凸约束的凸规划问题，发展了一种锥分枝定界方法，并给出收敛性条件。

• objective: to search optimal solutions of convex programming problems with linear constraints.

  求线性约束凸规划问题的最优解。

• based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.

  提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。